Conference proceedings article
Monotone deterministic RL-automata don't need auxiliary symbols
Publication Details
Authors: | Jurdzinski, T.; Mraz, F.; Otto, F.; Platek, M. |
Editor: | De Felice, C. and Restivo, A. |
Publisher: | Springer |
Place: | Berlin |
Publication year: | 2005 |
Pages range : | 284-295 |
Book title: | Developments in Language Theory, Proceedings DLT 2005 |
Title of series: | Lecture Notes in Computer Science 3572 |
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.
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.
Projects
