Skip to main content
SpringerLink
Log in

Restarting automata with rewriting

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover SOFSEM'96: Theory and Practice of Informatics (SOFSEM 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1175))

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Google Scholar 

  2. 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

    Google Scholar 

  3. S. Marcus: Contextual grammars, Revue Roum. Math. Pures Appl.,14, 10, 1969, pp.1525–1534

    Google Scholar 

  4. M. Novotný: S algebrou od jazyka ke gramatice a zpět, Academia, Praha, 1988, (in Czech)

    Google Scholar 

  5. M. Procházka: Syntax Errors and Their Detection, Diploma Work on MFF UK (in Czech), Prague, 1994

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    František Mráz & Martin Plátek

  2. Computer Science Institute, Friedrich Schiller University, 07740, Jena, Germany

    Jörg Vogel

Authors
  1. František Mráz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Plátek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jörg Vogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Keith G. Jeffery Jaroslav Král Miroslav Bartošek

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation