Skip to main content
SpringerLink
Log in

Theory of One Tape Linear Time Turing Machines

  • Conference paper
SOFSEM 2004: Theory and Practice of Computer Science (SOFSEM 2004)

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

Abstract

A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart. This paper discusses the computational complexity of one-tape Turing machines of various machine types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in time O(n), where the running time of a machine is defined as the height of its computation tree. We also address a close connection between one-tape linear-time Turing machines and finite state automata.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum Computability. SIAM J. Comput. 26, 1524–1540 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bennett, C.H.: Logical Reversibility of Computation. IBM J. Res. Develop. 17, 525–532 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bernstein, E., Vazirani, U.: Quantum Complexity Theory. SIAM J. Comput. 26, 1411–1473 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Brodsky, A., Pippenger, N.: Characterizations of 1-Way Quantum Finite Automata. SIAM J. Comput. 31, 1456–1478 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Damm, C., Holzer, M.: Automata that Take Advice. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 149–158. Springer, Heidelberg (1995)

    Google Scholar 

  6. Dwork, C., Stockmeyer, L.J.: A Time Complexity Gap for Two-Way Probabilistic Finite State Automata. SIAM J. Comput. 19, 1011–1023 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dwork, C., Stockmeyer, L.: Finite State Verifiers I: The Power of Interaction. J. ACM 39, 800–828 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hennie, F.C.: One-Tape, Off-Line Turing Machine Computations. Inform. Control 8, 553–578 (1965)

    Article  MathSciNet  Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  10. Karp, R.M.: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines. J. ACM 14, 478–489 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kaneps, J., Freivalds, R.: Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 355–361. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  12. Kobayashi, K.: On the Structure of One-Tape Nondeterministic Turing Machine Time Hierarchy. Theor. Comput. Sci. 40, 175–193 (1985)

    Article  MATH  Google Scholar 

  13. Kondacs, A., Watrous, J.: On the Power of Quantum Finite State Automata. In: Proc. 38th FOCS, pp. 66–75 (1997)

    Google Scholar 

  14. Macarie, I.I.: Space-Efficient Deterministic Simulation of Probabilistic Automata. SIAM J. Comput. 27, 448–465 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Michel, P.: An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine. Theor. Comput. Sci. 85, 205–212 (1991)

    Article  MATH  Google Scholar 

  16. Rabin, M.O.: Probabilistic Automata. Inform. Control 6, 230–245 (1963)

    Article  Google Scholar 

  17. Turakainen, P.: On Stochastic Languages. Inform. Control 12, 304–313 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  18. Turakainen, P.: On Languages Representable in Rational Probabilistic Automata. Annales Academiae Scientiarum Fennicae, Ser. A 439, 4–10 (1969)

    MathSciNet  Google Scholar 

  19. Turakainen, P.: Generalized Automata and Stochastic Languages. Proc. Amer. Math. Soc. 21, 303–309 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  20. Yamakami, T.: Average Case Complexity Theory. Ph.D. Dissertation, University of Toronto. Technical Report 307/97, University of Toronto. See also ECCC Thesis Listings (1997)

    Google Scholar 

  21. Yamakami, T.: A Foundation of Programming a Multi-Tape Quantum Turing Machine. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 430–441. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  22. Yamakami, T.: Analysis of Quantum Functions. To appear in: International Journal of Foundations of Computer Science; A preliminary version appeared in: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.): FST TCS 1999. LNCS, vol. 1738, pp. 407–419. Springer, Heidelberg (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ERATO Quantum Computation and Information Project, Japan Science and Technology Corporation, Tokyo, Japan

    Kohtaro Tadaki

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada

    Tomoyuki Yamakami & Jack C. H. Lin

Authors
  1. Kohtaro Tadaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomoyuki Yamakami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jack C. H. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, ILLC - Department of Mathematics and Computer Science, University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Peter Van Emde Boas

  2. Faculty of Mathematics and Physics, Charles University, Prague

    Jaroslav Pokorný

  3. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava

    Mária Bieliková

  4. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague 8 Czech Republic

    Július Štuller

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tadaki, K., Yamakami, T., Lin, J.C.H. (2004). Theory of One Tape Linear Time Turing Machines. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2004: Theory and Practice of Computer Science. SOFSEM 2004. Lecture Notes in Computer Science, vol 2932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24618-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24618-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24618-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation