Abstract
Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and (special) regulated rewriting systems on the other hand. The computation of a restarting automaton proceeds in 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.
We show a taxonomy of (sub)variants of these automata taking into account (non)determinism and two other natural properties.
Theoretical significance of the restarting automata is also demonstrated by relating it to context-free languages (CFL), by which a characterization of deterministic CFL is obtained.
Supported by the Grant Agency of the Czech Republic, Grant-No. 201/96/0195
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Dassow, G. Păun: Regulated Rewriting in Formal Language Theory; EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1989
J. Hopcroft, J. Ullman: Introduction to Automata Theory, Languages, and Computation; Addison-Wesley, 1979
P. Jančar, F. Mráz, M. Plátek: A Taxonomy of Forgetting Automata; in: Proc. of MFCS 1993; Gdańsk, Poland, LNCS 711, Springer Verlag, 1993, pp. 527–536
P. Jančar, F. Mráz, M. Plátek, J. Vogel: Restarting Automata; in: Proc. of FCT'95; Dresden, Germany, LNCS 965, Springer Verlag, 1995, pp. 283–292
P. Jančar, F. Mráz, M. Plátek, M. Procházka, J. Vogel: Restarting Automata, Marcus Grammars and Context-Free Languages; in: J. Dassow, G. Rozenberg, A. Salomaa (eds.): Developments in Language Theory; World Scientific Publ., 1995, pp. 102–111
S. Marcus: Contextual grammars; Revue Roum. Math. Pures Appl., 14, 10, 1969, pp.1525–1534
F. Mráz, M. Plátek, J. Vogel: Restarting Automata with Rewriting; in Proc. of SOFSEM'96; LNCS 1175, Springer Verlag 1996, to appear
M. Novotný: S algebrou od jazyka ke gramatice a zpět; Academia, Praha, 1988 (in Czech)
S. H. von Solms: The Characterization by Automata of Certain Classes of Languages in the Context Sensitive Area; Inform. Control 27, 1975, pp. 262–271
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jančar, P., Mráz, F., Plátek, M., Vogel, J. (1997). On restarting automata with rewriting. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive