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 条
  • [31] On timed coordination languages
    Jacquet, JM
    De Bosschere, K
    Brogi, A
    COORDINATION LANGUAGES AND MODELS, PROCEEDINGS, 2000, 1906 : 81 - 98
  • [32] State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
    Hoffmann, Stefan
    INFORMATION AND COMPUTATION, 2024, 301
  • [33] Timed regular expressions
    Asarin, E
    Caspi, P
    Maler, O
    JOURNAL OF THE ACM, 2002, 49 (02) : 172 - 206
  • [34] Shuffle and scattered deletion closure of languages
    Ito, M
    Kari, L
    Thierrin, G
    THEORETICAL COMPUTER SCIENCE, 2000, 245 (01) : 115 - 133
  • [35] Literal shuffle on omega-languages
    Moriya, T
    Yamasaki, H
    INFORMATION PROCESSING LETTERS, 1996, 59 (03) : 165 - 168
  • [36] An algebraic approach to data languages and timed languages
    Bouyer, P
    Petit, A
    Thérien, D
    INFORMATION AND COMPUTATION, 2003, 182 (02) : 137 - 162
  • [37] On the uniqueness of shuffle on words and finite languages
    Biegler, Franziska
    Daley, Mark
    Holzer, Markus
    McQuillan, Ian
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3711 - 3724
  • [38] On the Shuffle of Star-Free Languages
    Castiglione, Giusi
    Restivo, Antonio
    FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 35 - 44
  • [39] On Approximating Non-regular Languages by Regular Languages
    Eisman, Gerry
    Ravikumar, Bala
    FUNDAMENTA INFORMATICAE, 2011, 110 (1-4) : 125 - 142
  • [40] Inferring regular languages and ω-languages
    Fisman, Dana
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2018, 98 : 27 - 49
12345