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
来源：
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | 2006年 / 88期
关键词：
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 条
  • [41] EXTENDING REGULAR EXPRESSIONS WITH ITERATED SHUFFLE
    JANTZEN, M
    THEORETICAL COMPUTER SCIENCE, 1985, 38 (2-3) : 223 - 247
  • [42] Timed automata and timed languages challenges and open problems*
    Asarin, E
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2003, 2791 : 1 - 1
  • [43] A nonarchimedian discretization for timed languages
    Dima, C
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2003, 2791 : 168 - 181
  • [44] Syllable-timed languages
    Cagliari, Luiz Carlos
    REVISTA DE ESTUDOS DA LINGUAGEM, 2012, 20 (02) : 23 - 58
  • [45] A Nonarchimedian Discretization for Timed Languages
    Dima, Catalin
    FUNDAMENTA INFORMATICAE, 2014, 131 (3-4) : 389 - 407
  • [46] Generating Functions of Timed Languages
    Asarin, Eugene
    Basset, Nicolas
    Degorre, Aldric
    Perrin, Dominique
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 124 - 135
  • [47] Regular patterns, regular languages and context-free languages
    Jain, Sanjay
    Ong, Yuh Shin
    Stephan, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1114 - 1119
  • [48] Regular expressions with timed dominoes
    Dima, C
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 141 - 154
  • [49] Bi-catenation and shuffle product of languages
    Shyr, HJ
    Yu, SS
    ACTA INFORMATICA, 1998, 35 (08) : 689 - 707
  • [50] Lower space bounds for accepting shuffle languages
    Szepietowski, Andrzej
    Theoretical Informatics and Applications, 1999, 33 (03): : 303 - 307
12345