Beitrag in einem Tagungsband
Monotone deterministic RL-automata don't need auxiliary symbols



Details zur Publikation
Autor(inn)en:
Jurdzinski, T.; Mraz, F.; Otto, F.; Platek, M.
Herausgeber:
De Felice, C. and Restivo, A.
Verlag:
Springer
Verlagsort / Veröffentlichungsort:
Berlin
Publikationsjahr:
2005
Seitenbereich:
284-295
Buchtitel:
Developments in Language Theory, Proceedings DLT 2005
Titel der Buchreihe:
Lecture Notes in Computer Science 3572

Zusammenfassung, Abstract
It is known that for monotone deterministic one-way restarting automata, the use of auxiliary symbols does not increase the expressive power. Here we show that the same is true for deterministic two-way restarting automata that axe right- or left-monotone. Actually in these cases it suffices to admit delete operations instead of the more general rewrite operations. In addition, we characterize the classes of languages that axe accepted by these types of two-way restarting automata by certain combinations of deterministic pushdown automata and deterministic transducers.


Autor(inn)en / Herausgeber(innen)

Zuletzt aktualisiert 2019-25-07 um 17:38