On nonforgetting restarting automata that are deterministic and/or monotone

Authors:
Hartmut Messerschmidt;Friedrich Otto
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, Kassel;Fachbereich Mathematik/Informatik, Universität Kassel, Kassel
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 10
Cited 4

Growing context-sensitive languages and Church-Rosser languages

Information and Computation
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Finite-Change Automata

Proceedings of the 4th GI-Conference on Theoretical Computer Science
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
Monotone deterministic RL-Automata don't need auxiliary symbols

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

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On left-monotone deterministic restarting automata

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

Restarting Tree Automata

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Strictly deterministic CD-systems of restarting automata

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The nonforgetting restarting automaton is a restarting automaton that is not forced to reset its internal state to the initial state when executing a restart operation. We analyse the expressive power of the various deterministic and/or monotone variants of this model.