Abstract
Motivated by (natural as well as formal) language analysis, we introduce a special kind of the linear bounded automaton — so called restarting automaton (R-automaton). Its computation proceeds in certain cycles; in each cycle, a (bounded) subsequence of the input word is removed and the computation restarts on the arising shorter word. We consider both nondeterministic and deterministic versions and introduce a natural property of monotonocity. The main result illustrating usefulness of the introduced notions is an elegant characterization of deterministic context-free languages — by deterministic monotonic R-automata. We also show that the monotonocity property is decidable and complete the paper with some related results.
The first author was supported by the Grant Agency of the Czech Republic, Grant-No. 201/93/2123
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Jančar, F. Mráz, M. Plátek: A taxonomy of forgetting automata; in Proceedings of MFCS 1993, Gdańsk, Poland; LNCS 711, 527–536, Springer-Verlag, 1993
P. Jančar, F. Mráz, M. Plátek, M. Procházka, J. Vogel: Restarting Automata and Marcus Grammars, TR Math/95/1 Friedrich Schiller University, Jena, 1995 (accepted for the Second International Conference Developments in Language Theory)
P. Jancar, F. Mráz, M. Plátek, J. Vogel: Restarting Automata, TR Math/94/8 Friedrich Schiller University, Jena, 1994
S. Marcus: Algebraic Linguistics; Analytical Models, Academic Press, New York and London, 1967
L. Nebeský: On One Formalization of Sentence Analysis, Slovo a Slovesnost (in Czech), No 2, 104–107, 1962 [Translation to russian: L. Nebeskij: Ob odnoj formalizacii razbora predlozhenija, In: Matematitcheskaja lingvistika, Mir 145–149, 1964]
G. Paun: On Some Open Problems about Marcus Contextual Languages, Intern. J. Computer Math., Vol. 17 9–23, 1985
M. Plátek: Syntactic Error Recovery with Formal Guarantees I.; TR No. 100, Department of Computer Science, Charles University, Prague, 1992
M. Procházka: Syntax Errors and Their Detection, Diploma Thesis (in Czech), Charles University, Prague, 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jančar, P., Mráz, F., Plátek, M., Vogel, J. (1995). Restarting automata. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_60
Download citation
DOI: https://doi.org/10.1007/3-540-60249-6_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60249-1
Online ISBN: 978-3-540-44770-2
eBook Packages: Springer Book Archive