On left-monotone deterministic 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 5
Cited 4

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
Restarting automata and their relations to the Chomsky hierarchy

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

Restarting automata with restricted utilization of auxiliary symbols

Theoretical Computer Science - Implementation and application of automata
On determinism versus nondeterminism for restarting automata

Information and Computation
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Monotone deterministic RL-Automata don't need auxiliary symbols

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of left-monotonicity is introduced for the restarting automaton, and the expressive power of the various types of left-monotone restarting automata is studied. We concentrate on the deterministic classes, as here the results differ greatly from those for the corresponding classes of (right-) monotone restarting automata.