Characterizing the regular languages by nonforgetting restarting automata

Authors:
Norbert Hundeshagen;Friedrich Otto
Affiliations:
Fachbereich Elektrotechnik, Informatik, Universität Kassel, Kassel, Germany;Fachbereich Elektrotechnik, Informatik, Universität Kassel, Kassel, Germany
Venue:
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Year:
2011

Citing 8
Cited 2

Church-Rosser Thue systems and formal languages

Journal of the ACM (JACM)
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
Lookahead hierarchies of restarting automata

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
On Restarting Automata with Rewriting

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Restarting Automata

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata

Theory of Computing Systems
Globally deterministic CD-systems of stateless R(1)-automata

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
CD-systems of stateless deterministic r(1)-automata accept all rational trace languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Characterizing the rational functions by restarting transducers

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study nonforgetting R- and nonforgetting deterministic RR-automata of window size one, that is, nf-R(1)- and det-nf-RR(1)- automata. Our main result shows that the monotone variants of these two types of restarting automata characterize the regular languages. On the other hand, we prove that already the non-monotone deterministic nonforgetting R(1)-automata accept a class of languages that is incomparable to the class of semi-linear languages with respect to inclusion, but that properly includes the class of languages that are accepted by globally deterministic cooperating distributed systems of stateless deterministic R(1)-automata.