| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 2, April-June 2007
|
|
|---|---|---|
| Page(s) | 157 - 175 | |
| DOI | https://doi.org/10.1051/ita:2007013 | |
| Published online | 18 July 2007 | |
Sequential monotonicity for restarting automata
1
Institute of Computer Science,
University of Wrocław, 51-151 Wrocław, Poland; tju@ii.uni.wroc.pl
2
Fachbereich Elektrotechnik/Informatik, Universität Kassel,
34109 Kassel, Germany; otto@theory.informatik.uni-kassel.de
Received:
17
November
2005
Accepted:
15
June
2006
As already 2-monotone R-automata accept NP-complete languages, we introduce a restricted variant of j-monotonicity for restarting automata, called sequential j-monotonicity. For restarting automata without auxiliary symbols, this restricted variant still yields infinite hierarchies. However, for restarting automata with auxiliary symbols, all degrees of sequential monotonicity collapse to the first level, implying that RLWW-automata that are sequentially monotone of degree j for any j ≥ 1 only accept context-free languages.
Mathematics Subject Classification: 68Q45
Key words: Restarting automaton / sequential monotonicity / hierarchies
© EDP Sciences, 2007
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.