Skip to main content
SpringerLink
Log in

The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

It is shown, that NTAPE(n) is equal to TAPE(n) if and only if every language L⊂⊣{1}*⊢ which is acceptable by a nondeterministic two-way one-counter automaton whose counter length is bounded by the length of its input is contained in TAPE(log n).

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. Book, R.V.: On the structure of complexity classes. Automata, languages and programming, 2nd Colloquium, pp. 437–445 (1974)

  2. Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Counter machines and counter languages. Math. Systems Theory 3, 265–283 (1968)

    MathSciNet  Google Scholar 

  3. Galil, Z.: Two way deterministic pushdown automaton languages and some open problems in the theory of computation. 15th Ann. Symp. Switch. Autom. Theory, pp. 170–177, 1974

  4. Monien, B.: Transformational methods and their application to complexity problems. Acta Informat. 6, 95–108 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  5. Savitch, W. J.: A note on multihead automata and context-sensitive languages. Acta Informat. 2, 249–252 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  6. Schnorr, C.P.: Rekursive Funktionen und ihre Komplexität. Stuttgart: Teubner 1974

    Google Scholar 

  7. Sudborough, I.H.: A note on tape-bounded complexity classes and linear context-free languages. J. Assoc. Comput. Mach. 22, 499–500 (1975)

    MATH  MathSciNet  Google Scholar 

  8. Sudborough, I.H.: On tape-bounded complexity classes and multihead finite automata. J. Comput. System Sci. 10, 62–76 (1975)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Burkhard Monien

    Present address: Fachbereich Mathematik/Informatik der Gesamthochschule Paderborn, Warburger Str. 100, D-4790, Paderborn, Germany (Fed. Rep.)

Authors and Affiliations

  1. Abteilung Informatik der Universität, Postfach 500500, D-4600, Dortmund 50, Germany (Fed. Rep.)

    Burkhard Monien

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monien, B. The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet. Acta Informatica 8, 371–382 (1977). https://doi.org/10.1007/BF00271345

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation