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 条
  • [1] Shuffle decomposition of regular languages
    Ito, M
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2002, 8 (02): : 257 - 259
  • [2] Entropy of regular timed languages
    Asarin, Eugene
    Basset, Nicolas
    Degorre, Aldric
    INFORMATION AND COMPUTATION, 2015, 241 : 142 - 176
  • [3] The Commutative Closure of Shuffle Languages over Group Languages is Regular
    Hoffmann, Stefan
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2021), 2021, 12803 : 53 - 64
  • [4] ON THE ENLARGEMENT OF THE CLASS OF REGULAR LANGUAGES BY THE SHUFFLE CLOSURE
    JEDRZEJOWICZ, J
    INFORMATION PROCESSING LETTERS, 1983, 16 (02) : 51 - 54
  • [5] Thin and Thick Timed Regular Languages
    Basset, Nicolas
    Asarin, Eugene
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2011, 6919 : 113 - +
  • [6] A logical characterization of timed regular languages
    Bersani, Marcello M.
    Rossi, Matteo
    San Pietro, Pierluigi
    THEORETICAL COMPUTER SCIENCE, 2017, 658 : 46 - 59
  • [8] Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
    Hoffmann, Stefan
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2021), 2021, 12803 : 27 - 38
  • [9] Unambiguity in Timed Regular Languages: Automata and Logics
    Pandya, Paritosh K.
    Shah, Simoni S.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2010, 6246 : 168 - 182
  • [10] Volume and Entropy of Regular Timed Languages: Analytic Approach
    Asarin, Eugene
    Degorre, Aldric
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2009, 5813 : 13 - +