Characterization of context-pree languages by erasing automata

  • Petr Jančar
  • František Mráz
  • Martin Plátek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)


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.


Regular Language Input Word Grammar Rule Terminal Symbol Nondeterministic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–100Google Scholar
  2. 2.
    Chytil M.P., Plátek M., Vogel J.: A Note on the Chomsky hierarchy, Bulletin of the EATCS 27, 1985Google Scholar
  3. 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–112Google Scholar
  4. 4.
    Hibbard, T.N.: A generalization of context-free determinism, Information and Control 11, 1967, pp. 196–238.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata, Addison-Wesley, Reading, Massachusetts, 1969zbMATHGoogle Scholar
  6. 6.
    Immerman, N.: Nondeterministic space is closed under complement, Proceedings of the 3rd Annual Conference Structure in Complexity Theory, June 1988, pp. 14–17Google Scholar
  7. 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 1991Google Scholar
  8. 8.
    Plátek M., Vogel J.: Deterministic List Automata and Erasing Graphs, The Prague bulletin of mathematical linguistics 45, 1986Google Scholar
  9. 9.
    Sheperdson, J.C.: The Reduction of two-way automata to one way automata, IBM J. Res. Develop. 3, 1959, pp. 198–200MathSciNetCrossRefGoogle Scholar
  10. 10.
    Szelepcsény, R.: The Method of Forsed Enumeration for nondeterministic automata, Acta Informatica Vol. 26, No. 3, November 1988, pp. 279–284MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Petr Jančar
    • 1
  • František Mráz
    • 2
  • Martin Plátek
    • 2
  1. 1.Department of Computer ScienceUniversity of OstravaOstravaCzechoslovakia
  2. 2.Department of Computer ScienceCharles UniversityPraha 1Czechoslovakia

Personalised recommendations