Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1996: Automata, Languages and Programming pp 381–392Cite as

Speeding-up single-tape nondeterministic computations by single alternation, with separation results

  • Session 8: Complexity Theory
  • Conference paper
  • First Online:

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

Abstract

It is shown that for any well behaved function T(n), any single-tape nondeterministic Turing Machine of time complexity T(n) can be simulated by a single-tape Σ2-machine in time T(n)/logT(n). A similar result holds also for complementary, single-tape co-nondeter-ministic and II 2machines. Consequently, NTIME1(T(n)) is strictly contained in Σ2-TIME1(T(n)), and analogously co-TIME1(T(n)) in II 2-TIME1(T(n)), i.e., for single tape nondeterministic or co-nondeterministic machines adding of one more alternation leads to provably more powerful machines.

This research was supported by GA ČR Grant No. 201/95/0976 “HypercompleX”, and partly by Cooperative Action IC 1000 (Project “ALTEC”) of the European Union

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gupta, S.: Alternating Time Versus Deterministic Time: A Separation. Proc. of Structure in Complexity, San Diego, 1993

    Google Scholar 

  2. Hopcroft, J. — Paul, W. — Valiant L.: On time versus space and related problems. Proc. IEEE FOCS 16, 1975, pp. 57–64

    Google Scholar 

  3. Kannan, R.: Alternation and the power of nondeterminism (Extended abstract). Proc. 15-th STOC, 1983, pp. 344–346

    Google Scholar 

  4. Li, M. — Neuféglise, H. — Torenvliet, L. — van Emde Boas, P.: On Space Efficient Simulations. ITLI Prepublication Series, CS-89-03, University of Amsterdam, 1989

    Google Scholar 

  5. Lorys, K. — Liskiewicz, M.: Two Applications of Führers Counter to One-Tape Nondeterministic TMs. Proceedings of the MFCS'88, LNCS Vol. 324, Springer Verlag, 1988, pp. 445–453

    Google Scholar 

  6. Maass, W. — Schorr, A.: Speed-up of Turing Machines with One Work Tape and Two-way Input Tape. SIAM J. Comput., Vol. 16, no. 1, 1987, pp. 195–202

    Article  Google Scholar 

  7. Paterson, M.: Tape Bounds for Tape-Bounded Turing Machines, JCSS, Vol. 6, 1972, pp. 115–124

    Google Scholar 

  8. Paul, W. — Pippenger, E. — Szemeredi, E. — Trotter, W.: On Determinism versus Nondeterminism and Related Problems. Proc. 24-th FOCS, 1983, pp. 429–438

    Google Scholar 

  9. Paul, W. — Prauss, E. J. — Reischuk, R.: On Alternation. Acta, Informatica, 14, 1980, pp. 243–255

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 2, 18207, Prague, Czech Republic

    Jiří Wiedermann

Authors
  1. Jiří Wiedermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedhelm Meyer Burkhard Monien

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wiedermann, J. (1996). Speeding-up single-tape nondeterministic computations by single alternation, with separation results. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_144

Download citation

  • DOI: https://doi.org/10.1007/3-540-61440-0_144

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61440-1

  • Online ISBN: 978-3-540-68580-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation