Skip to main content
Springer Nature Link
Log in

Nondeterministic computations in sublogarithmic space and space constructibility

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

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

Included in the following conference series:

Abstract

The open problem of nondeterministic space constructibility for sublogarithmic functions is resolved. We show that there are no unbounded monotone increasing nondeterministically space constructible functions with supn→∞s(n)/log(n)=0. Consequently, the space constructibility cannot be used to separate nondeterministic space from deterministic one, since functions like loglog(n), and \(\sqrt {\log (n)}\)are not space constructible by nondeterministic Turing machines.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.R. Freedman,R.E. Ladner: Space bounds for processing counterless inputs, Journal of Computer and System Sciences, 11:118–128, 1975

    Google Scholar 

  2. M.A.Harrison: Introduction to formal language theory, Addison-Wesley Pub.Co., 1978

    Google Scholar 

  3. J. Hartmanis,D. Ranjan: Space bounded Computations: Review and new separation results, Proceeding of MFCS'89, LNCS 379, Springer-Verlag, 1989, 49–66

    Google Scholar 

  4. J.E. Hopcroft,J.D. Ullman: Formal languages and their relation to automata, Addison-Wesley Pub.Co., Reading Mass., 1969

    Google Scholar 

  5. N.Immerman: Nondeterministic space is closed under complement, Proceeding of Structure in Complexity Theory, 3rd Annual Conference, 112–115, Comput. Society of IEEE, 1988

    Google Scholar 

  6. P.M.Lewis II,R.E.Stearns,J.Hartmanis: Memory bounds for recognition of context-free and context-sensitive languages, IEEE Conference Record on Switching Circuit Theory and Logical Design, 191–202, 1965

    Google Scholar 

  7. W.J. Savitch: Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, 4:177–192, 1970

    Google Scholar 

  8. Seiferas: A note on notions of tape constructibility, Technical Report CSD-TR 187, Pennsylvania State University, 1976

    Google Scholar 

  9. R.E.Stearns,J.Hartmanis,P.M.Lewis II: Hierarchies of memory limited computations, IEEE Conference Record on Switching Circuit Theory and Logical Design, 179–190, 1965

    Google Scholar 

  10. R. Szelepcsényi: The method of forced enumeration for nondeterministic automata, Acta Informatica, 26,279–284(1988)

    Google Scholar 

  11. M. Sipser: Halting space-bounded computations, Theoretical Computer Science, 10:335–338,1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of P.J.Šafárik, Jesenná 5, 04154, Košice, Czechoslovakia

    Viliam Geffert

Authors
  1. Viliam Geffert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geffert, V. (1990). Nondeterministic computations in sublogarithmic space and space constructibility. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032026

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics