ON THE SHUFFLE OF REGULAR TIMED LANGUAGES

被引:0
|
作者
Finkel, Olivier [1 ]
机构
[1] Univ Paris 07, UFR Math, Equipe Log Math, 2 Pl Jussieu, F-75251 Paris 05, France
关键词
Timed automata; timed regular languages; closure properties; shuffle operation;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that the class of regular timed languages is not closed under shuffle. This gives an answer to a question which was raised by E. Asarin in [2].
引用
收藏
页码:182 / 184
页数:3
相关论文
共 50 条
  • [21] Expressiveness of timed events and timed languages
    Cacciagrano, DR
    Corradini, F
    FORMAL METHODS FOR THE DESIGN OF REAL-TIME SYSTEMS, 2004, 3185 : 98 - 131
  • [22] Shuffle on positive varieties of languages
    Gómez, AC
    Pin, JE
    THEORETICAL COMPUTER SCIENCE, 2004, 312 (2-3) : 433 - 461
  • [23] Properties of Languages with Catenation and Shuffle
    Kudlek, Manfred
    Flick, Nils Erik
    FUNDAMENTA INFORMATICAE, 2014, 129 (1-2) : 117 - 132
  • [24] A Hierarchy of Languages with Catenation and Shuffle
    Kudlek, Manfred
    Flick, Nils Erik
    FUNDAMENTA INFORMATICAE, 2013, 128 (1-2) : 113 - 128
  • [25] On a Hierarchy of Languages with Catenation and Shuffle
    Flick, Nils Erik
    Kudlek, Manfred
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 452 - 458
  • [26] Automata for regular expressions with shuffle
    Broda, Sabine
    Machiavelo, Antonio
    Moreira, Nelma
    Reis, Rogerio
    INFORMATION AND COMPUTATION, 2018, 259 : 162 - 173
  • [27] Equations on timed languages
    Asarin, E
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, 1998, 1386 : 1 - 12
  • [28] UNTIMING TIMED LANGUAGES
    BERARD, B
    INFORMATION PROCESSING LETTERS, 1995, 55 (03) : 129 - 135
  • [29] Untiming timed languages
    LIFAC, Cachan, France
    Inf Process Lett, 3 (129-135):
  • [30] On recognizable timed languages
    Maler, O
    Pnueli, A
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 348 - 362