Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1992: Mathematical Foundations of Computer Science 1992 pp 307–314Cite as

Characterization of context-pree languages by erasing automata

  • Conference paper
  • First Online:

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

Abstract

It is shown that context-free languages are recognizable by (non-deterministic) erasing automata; thereby a hypothesis of [1] is denied. In addition, the class of context-free languages is characterized by means of the automata which erase each cell at the second visit at latest.

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. von Braunmühl B., Verbeek R.: Finite change automata. Proceedings of the Fourth GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science, vol.67, Springer-Verlag, Berlin, 1979, pp. 91–100

    Google Scholar 

  2. Chytil M.P., Plátek M., Vogel J.: A Note on the Chomsky hierarchy, Bulletin of the EATCS 27, 1985

    Google Scholar 

  3. Chytil M.P., Karlgren H.: Categorial grammars and list automata for strata of non-CF-languages; in Buszkowski W., Marciszewski W., van Benthem J. (eds.): Categorial Grammars, Linguistic and literary studies in Eastern Europe 25, 1988, pp. 85–112

    Google Scholar 

  4. Hibbard, T.N.: A generalization of context-free determinism, Information and Control 11, 1967, pp. 196–238.

    Article  MATH  MathSciNet  Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata, Addison-Wesley, Reading, Massachusetts, 1969

    MATH  Google Scholar 

  6. Immerman, N.: Nondeterministic space is closed under complement, Proceedings of the 3rd Annual Conference Structure in Complexity Theory, June 1988, pp. 14–17

    Google Scholar 

  7. Mráz F., Plátek M.: Erasing automata recognize more than context-free languages, in Proceedings of the annual Czechoslovak conference SOFSEM'91, November 1991

    Google Scholar 

  8. Plátek M., Vogel J.: Deterministic List Automata and Erasing Graphs, The Prague bulletin of mathematical linguistics 45, 1986

    Google Scholar 

  9. Sheperdson, J.C.: The Reduction of two-way automata to one way automata, IBM J. Res. Develop. 3, 1959, pp. 198–200

    Article  MathSciNet  Google Scholar 

  10. Szelepcsény, R.: The Method of Forsed Enumeration for nondeterministic automata, Acta Informatica Vol. 26, No. 3, November 1988, pp. 279–284

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Ostrava, Dvořákova 7, 701 03, Ostrava, Czechoslovakia

    Petr Jančar

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

    František Mráz & Martin Plátek

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. František Mráz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Plátek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P., Mráz, F., Plátek, M. (1992). Characterization of context-pree languages by erasing automata. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation