Hierarchies of weakly monotone restarting automata

被引：5
|
作者：
Mráz, F
Otto, F
机构：
[1] Charles Univ, Dept Comp Sci, CR-11800 Prague, Czech Republic
[2] Univ Kassel, Fachbereich Math Informat, D-34109 Kassel, Germany
来源：
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2005年 / 39卷 / 02期
关键词：
restarting automata; weak monotonicity; hierarchies;
D O I：
10.1051/ita:2005021
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
引用
收藏
页码：325 / 342
页数：18
相关论文
共 50 条
  • [1] On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)
    Schluter, Natalie
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 440 - 441
  • [2] On nonforgetting restarting automata that are deterministic and/or monotone
    Messerschmidt, Hartmut
    Otto, Friedrich
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 247 - 258
  • [3] On the complexity of 2-monotone restarting automata
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 237 - 248
  • [4] On left-monotone deterministic restarting automata
    Jurdzinski, T
    Otto, F
    Mráz, F
    Plátek, M
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 249 - 260
  • [5] On the complexity of 2-monotone restarting automata
    Jurdzinski, Tomasz
    Otto, Friedrich
    Mraz, Frantiek
    Platek, Martin
    [J]. THEORY OF COMPUTING SYSTEMS, 2008, 42 (04) : 488 - 518
  • [6] On the Complexity of 2-Monotone Restarting Automata
    Tomasz Jurdziński
    Friedrich Otto
    František Mráz
    Martin Plátek
    [J]. Theory of Computing Systems, 2008, 42 : 488 - 518
  • [7] On Lexicalized Well-Behaved Restarting Automata That Are Monotone
    Otto, Friedrich
    Platek, Martin
    Mraz, Frantisek
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, 2010, 6224 : 352 - +
  • [8] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (02) : 343 - 373
  • [9] A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
    Hartmut Messerschmidt
    Friedrich Otto
    [J]. Theory of Computing Systems, 2011, 48 : 343 - 373
  • [10] Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata
    Hundeshagen, Norbert
    Otto, Friedrich
    Vollweiler, Marcel
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 163 - 172
12345