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 条
  • [41] Languages Accepted by Weighted Restarting Automata
    Wang, Qichao
    FUNDAMENTA INFORMATICAE, 2021, 180 (1-2) : 151 - 177
  • [42] Weighted restarting automata and pushdown relations
    Wang, Qichao
    Otto, Friedrich
    THEORETICAL COMPUTER SCIENCE, 2016, 635 : 1 - 15
  • [43] On determinism versus nondeterminism for restarting automata
    Messerschmidt, Hartmut
    Otto, Friedrich
    INFORMATION AND COMPUTATION, 2008, 206 (9-10) : 1204 - 1218
  • [44] ON PRODUCT HIERARCHIES OF AUTOMATA
    DOMOSI, P
    ESIK, Z
    IMREH, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 137 - 144
  • [45] AUTOMATA AND QUANTIFIER HIERARCHIES
    THOMAS, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 386 : 104 - 119
  • [46] AUTOMATA AND QUANTIFIER HIERARCHIES
    THOMAS, W
    FORMAL PROPERTIES OF FINITE AUTOMATA AND APPLICATIONS, 1989, 386 : 104 - 119
  • [47] Monotone cellular automata
    Morris, Robert
    SURVEYS IN COMBINATORICS 2017, 2017, 440 : 312 - 371
  • [48] On the Descriptional Complexity of Deterministic Ordered Restarting Automata
    Otto, Friedrich
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 318 - 329
  • [49] Deterministic Ordered Restarting Automata that Compute Functions
    Otto, Friedrich
    Kwee, Kent
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 401 - 412
  • [50] Restarting automata with restricted utilization of auxiliary symbols
    Jurdzinski, Tomasz
    Otto, Friedrich
    THEORETICAL COMPUTER SCIENCE, 2006, 363 (02) : 162 - 181
12345