Skip to main content
SpringerLink
Log in

Language recognition by two-way deterministic pushdown automata

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

It is proved that any bounded context-free language can be recognized by a two-way deterministic automaton with a finite-rotary counter.

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

REFERENCES

  1. Z. Galil, “Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages,” Math. Syst. Theory, 10, 211–228 (1977).

    Google Scholar 

  2. W. Rytter, “A hardest language recognized by two-way nondeterministic pushdown automata,” Inform. Proc. Lett., 13, 145–146 (1981).

    Google Scholar 

  3. P. Duris and Z. Galil, “Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines,” Theoret. Comput. Sci., 21, 39–53 (1982).

    Google Scholar 

  4. S. Ginzburg, Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  5. L. Y. Liu and P. Weiner, “A characterization of semilinear sets,” J. Comput. System. Sci., No. 4, 299–307 (1970).

    Google Scholar 

  6. O. H. Ibarra and J. Su, “Counter machines: decision problems and applications,” in: Jewels are Forever, Springer, Berlin (1999), pp. 84–96.

    Google Scholar 

  7. L. P. Lisovik, “On solvable problems for transducers with finite-rotary counters,” Kibernetika, No. 3, 1–8 (1985).

  8. Monien, “Deterministic two-way one-head pushdown automata are very powerful,” Inform. Proc. Letters, 18, 239–242 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. T. G. Shevchenko National University, Kiev, Ukraine

    L. P. Lisovik & D. A. Koval’

Authors
  1. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. A. Koval’
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 177–181, November–December 2004.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P., Koval’, D.A. Language recognition by two-way deterministic pushdown automata. Cybern Syst Anal 40, 939–942 (2004). https://doi.org/10.1007/s10559-005-0034-7

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-005-0034-7

Keywords

Search

Navigation