Skip to main content
SpringerLink
Log in

Forgetting automata and context-free languages

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

It is shown that context-free languages can be characterized by linear bounded automata with the following restriction: the head can either move right without rewriting or move left with erasing the current cell (i.e. rewriting it with a special, nonrewriteable, symbol). If, instead of erasing, we consider deleting (complete removing of the cell), the corresponding automata are less powerful.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. von Braunmühl B., Verbeek R.: Finite change automata. Proc. 4th GI Conf. on Theoretical Computer Science (Lect. Notes in Comput. Sci., vol. 67, pp. 91–100) Berlin: Springer 1979

    Google Scholar 

  2. 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, John Benjamin, Amsterdam, Philadelphia 1988

    Google Scholar 

  3. Greibach, S.A.: The hardest context-free language. SIAM J. Comput. 2, 304–310 (1973)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Jančar, P.: Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata. Acta Math. et Inf. Univ. Ostraviensis, 1, Ostrava, 1993, pp. 67–73

    MATH  Google Scholar 

  6. Jančar P., Mráz, F., Plátek, M.: Characterization of context-free languages by erasing automata; In: Proc. MFCS’92, Prague, Czechoslovakia, August 1992, (Lect. Notes in Comput. Sci., Vol. 629, pp. 305–314) Berlin: Springer 1992

    Google Scholar 

  7. Jančar, P., Mráz, F., Plátek, M.: A taxonomy of forgetting automata. In: Proc. MFCS 1993, Gdańsk, Poland, September 1993, (Lect. Notes in Comput. Sci., Vol. 711, pp. 527–536) Berlin: Springer 1993

    Google Scholar 

  8. Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press New York and London 1967

    Google Scholar 

  9. Plátek, M., Vogel, J.: Deterministic list automata and erasing graphs. The Prague bulletin of mathematical linguistics 45, 1986

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Ostrava, Dvořákova 7, CZ-701 03, Ostrava, Czech Republic

    Petr Jančar

  2. Department of Computer Science, Charles University, Malostranské nám. 25, CZ-11800, Praha 1, Czech Republic

    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

Corresponding author

Correspondence to Petr Jančar.

Additional information

This author is supported by the Grant Agency of the Czech Republic, Grant No. 201/93/2123

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jančar, P., Mráz, F. & Plátek, M. Forgetting automata and context-free languages. Acta Informatica 33, 409–420 (1996). https://doi.org/10.1007/s002360050050

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050050

Keywords

Search

Navigation