On the complexity of 2-monotone restarting automata

Authors:
T. Jurdziński;F. Otto;F. Mráz;M. Plátek
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany;Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany;Department of Computer Science, Charles University, Prague, Czech Republic;Department of Computer Science, Charles University, Prague, Czech Republic
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 9
Cited 3

Membership for growing context-sensitive grammars is polynomial

Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Two-Way Restarting Automata and J-Monotonicity

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata

Theoretical Computer Science
On the gap-complexity of simple RL-Automata

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Restricting the use of auxiliary symbols for restarting automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The R-automaton is the weakest form of the restarting automaton. It is shown that the class of languages accepted by these automata is incomparable under set inclusion to the class of growing context-sensitive languages. In fact, this already holds for the class of languages that are accepted by 2-monotoneR-automata. Further it is shown that already this class contains NP-complete languages. Thus, already the 2-monotone R-automaton has a surprisingly large expressive power.