| Issue |
RAIRO-Theor. Inf. Appl.
Volume 39, Number 2, April-June 2005
|
|
|---|---|---|
| Page(s) | 325 - 342 | |
| DOI | https://doi.org/10.1051/ita:2005021 | |
| Published online | 15 April 2005 | |
Hierarchies of weakly monotone restarting automata
1
Department of Computer Science, Charles University,
Malostranské nám. 25,
118 00 Praha 1, Czech Republic;
mraz@ksvi.ms.mff.cuni.cz
2
Fachbereich Mathematik/Informatik, Universität Kassel,
34109 Kassel, Germany; otto@theory.informatik.uni-kassel.de
Received:
11
June
2003
Accepted:
5
May
2004
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.
Mathematics Subject Classification: 68Q10 / 68Q42 / 68Q45
Key words: Restarting automata / weak monotonicity / hierarchies
© EDP Sciences, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.