Beitrag in einem Sammelband
On the complexity of 2-monotone restarting automata



Details zur Publikation
Autor(inn)en:
Jurdzinski, T.; Otto, F.; Mraz, F.; Platek, M.
Herausgeber:
Calude, C.S., Calude, E. and Dinneen, M.J.
Verlag:
Springer
Verlagsort / Veröffentlichungsort:
Berlin
Publikationsjahr:
2004
Seitenbereich:
237-248
Buchtitel:
Developments in Language Theory, Proceedings DLT 2004
Titel der Buchreihe:
Lecture Notes in Computer Science 3340

Zusammenfassung, 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-monotone R-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.


Autor(inn)en / Herausgeber(innen)

Zuletzt aktualisiert 2019-25-07 um 13:15