Monotone deterministic RL-Automata don't need auxiliary symbols

Authors:
Tomasz Jurdziński;František Mráz;Friedrich Otto;Martin Plátek
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland;Faculty of Mathematics and Physics, Department of Computer Science, Charles University, PRAHA 1, Czech Republic;Fachbereich Mathematik/Informatik, Universität Kassel, Kassel, Germany;Faculty of Mathematics and Physics, Department of Computer Science, Charles University, PRAHA 1, Czech Republic
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 6
Cited 4

On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
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
Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Monotonicity of restarting automata

Journal of Automata, Languages and Combinatorics
On left-monotone deterministic restarting automata

DLT'04 Proceedings of the 8th international conference on Developments in Language Theory

Restarting automata with restricted utilization of auxiliary symbols

Theoretical Computer Science - Implementation and application of automata
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata

Theoretical Computer Science
Degrees of non-monotonicity for restarting automata

Theoretical Computer Science
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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 are 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 are accepted by these types of two-way restarting automata by certain combinations of deterministic pushdown automata and deterministic transducers.