Abstract
We introduce restarting automata with rewriting (RW-automata) as a generalization of restarting automata (R-automata). Their computation proceeds in certain cycles; in each cycle, a (bounded) substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word. Nondeterministic, deterministic, rewriting, and nonrewriting versions are considered and a natural property of monotonicity is introduced in a similar way as for R-automata. Monotonic RW-automata recognize a proper subset of CFL. A new characterization of deterministic context-free languages is given by deterministic monotonic RW-automata. Further different classes of RW-automata and the class of CFL are compared.
Supported by the Grant Agency of the Czech Republic, Grant-No. 201/96/0195
Preview
Unable to display preview. Download preview PDF.
References
P. Jančar, F. Mráz, M. Plátek, J. Vogel: Restarting Automata;, in Proc. FCT'95, Dresden, Germany, August 1995, LNCS 965, Springer Verlag 1995, pp. 283–292
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, Germany, January 1995
S. Marcus: Contextual grammars, Revue Roum. Math. Pures Appl.,14, 10, 1969, pp.1525–1534
M. Novotný: S algebrou od jazyka ke gramatice a zpět, Academia, Praha, 1988, (in Czech)
M. Procházka: Syntax Errors and Their Detection, Diploma Work on MFF UK (in Czech), Prague, 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mráz, F., Plátek, M., Vogel, J. (1996). Restarting automata with rewriting. In: Jeffery, K.G., Král, J., Bartošek, M. (eds) SOFSEM'96: Theory and Practice of Informatics. SOFSEM 1996. Lecture Notes in Computer Science, vol 1175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037423
Download citation
DOI: https://doi.org/10.1007/BFb0037423
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61994-9
Online ISBN: 978-3-540-49588-8
eBook Packages: Springer Book Archive