Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 1997: SOFSEM'97: Theory and Practice of Informatics pp 505–512Cite as

Monotonic rewriting automata with a restart operation

  • Contributed Papers
  • Conference paper
  • First Online:

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

Abstract

We introduce a hierarchy of monotonic rewriting automata with a restart operation and show that its deterministic version collapses in a sequence of characterizations of deterministic context-free languages. The nondeterministic version of it gives a proper hierarchy of classes of languages with the class of context-free languages on the top.

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.

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, J. Vogel: Restarting Automata with Rewriting;, in Proc. SOFSEM'96: Theory and practice of informatics, Milovy, Czech Republic, November 1996, LNCS 1175, Springer Verlag, 1996, pp. 401–408

    Google Scholar 

  3. P. Jančar, F. Mráz, M. Plátek, J. Vogel: On Restarting Automata with Rewriting, in New Trends in Formal Languages (Control, Cooperation and Combinatorics), Eds. G. Paun, A. Salomaa, LNCS 1218, Springer Verlag, 1997, pp. 119–136

    Google Scholar 

  4. F. Mráz, M. Plátek, P. Jančar, J. Vogel: On Monotonic Rewriting Automata with a Restart Operation, TR 97/6, Department of Computer Science, Charles University, 1997

    Google Scholar 

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

    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. Techn. Univ. of Ostrava, Univ. of Ostrava, Ostrava

    Petr Jančar

  3. 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. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jörg Vogel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

František Plášil Keith G. Jeffery

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mráz, F., Plátek, M., Jančar, P., Vogel, J. (1997). Monotonic rewriting automata with a restart operation. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_132

Download citation

  • DOI: https://doi.org/10.1007/3-540-63774-5_132

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63774-5

  • Online ISBN: 978-3-540-69645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation