Theory of one-tape linear-time Turing machines

Theoretical Computer Science

Volumn 411, Issue 1, 2010, Pages 22-43

  Tadaki, Kohtaro ^a   Yamakami, Tomoyuki ^b   Lin, Jack C H ^b  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Advice; Crossing sequence; Finite state automaton; Low set; Many one reducibility; One tape Turing machine; One way function; Regular language

Indexed keywords

ADVICE; CROSSING SEQUENCE; FINITE STATE AUTOMATA; ONE-WAY FUNCTIONS; REGULAR LANGUAGES;

FORMAL LANGUAGES; LINGUISTICS; MACHINERY; ROBOTS; TRANSLATION (LANGUAGES); TURING MACHINES;

FINITE AUTOMATA;

EID: 71749115987     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.08.031     Document Type: Article

References (47)

1. Adleman L.M., DeMarrais J., and Huang M.A. Quantum computability. SIAM J. Comput. 26 (1997) 1524-1540
2. Baker T.P., Gill J., and Solovay R. Relativizations of the P =? NP question. SIAM J. Comput. 4 (1975) 431-442
3. Balcázar J.L., Díaz J., and Gabarró J. Structural Complexity II (1990), Springer-Verlag
4. Bennett C.H. Logical reversibility of computation. IBM J. Res. Develop. 17 (1973) 525-532
5. Bernstein E., and Vazirani U. Quantum complexity theory. SIAM J. Comput. 26 (1997) 1411-1473
6. Chandra A., Kozen D., and Stockmeyer L. Alternation. J. ACM 28 (1981) 114-133
7. Condon A. Bounded error probabilistic finite state automata. In: Rajasekaran S., Pardalos P.M., Reif J.H., and Rolim J.D.P. (Eds). Handbook of Randomized Computing (2001), Kluwer
8. Damm C., and Holzer M. Automata that take advice. Proc. 20th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 969 (1995), Springer 149-158
9. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400 (1985) 97-117
10. Dieu P.D. On a class of stochastic languages. Zietschr. f. math. Logik und Grundlagen d. Math. Bd. 17 (1971) 421-425
11. Du D., and Ko K. Theory of Computational Complexity (2000), John Wiley & Sons
12. Dúriś P., and Galil Z. Two tapes are better than one for nondeterministic machines. SIAM J. Comput. 13 (1984) 219-227
13. Dwork C., and Stockmeyer L.J. A time complexity gap for two-way probabilistic finite state automata. SIAM J. Comput. 19 (1990) 1011-1023
14. Dwork C., and Stockmeyer L. Finite state verifiers I: The power of interaction. J. ACM 39 (1992) 800-828
15. Fortnow L., and Rogers J. Complexity limitations on quantum computation. J. Comput. System Sci. 59 (1997) 202-209
16. Gill J. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6 (1977) 675-695
17. Hemaspaandra L., and Ogihara M. The Complexity Theory Companion (2002), Springer
18. Hennie F.C. One-tape, off-line Turing machine computations. Inform. Control 8 (1965) 553-578
19. Hopcroft J.E., and Ullman J.D. Formal Languages and Their Relation to Automata (1969), Addison-Wesley
20. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
21. Kaņeps J. Stochasticity of the languages recognizable by 2-way finite probabilistic automata. Diskret. Mat. 1 (1989) 63-77 (in Russian)
22. Kaņeps J., and Freivalds R. Minimal nontrivial space complexity of probabilistic one-way Turing machines. Proc. 19th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 452 (1990), Springer 355-361
23. Karp R.M. Some bounds on the storage requirements of sequential machines and Turing machines. J. ACM 14 (1967) 478-489
24. Karp R.M., and Lipton R. Turing machines that take advice. L'Enseignement Math. 28 (1982) 191-209
25. Kobayashi K. On the structure of one-tape nondeterministic Turing machine time hierarchy. Theoret. Comput. Sci. 40 (1985) 175-193
26. A. Kondacs, J. Watrous, On the power of quantum finite state automata, in: Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 66-75
27. Krentel M. The complexity of optimization problems. J. Comput. System Sci. 36 (1988) 490-509
28. Macarie I.I. Space-efficient deterministic simulation of probabilistic automata. SIAM J. Comput. 27 (1998) 448-465
29. I.I. Macarie, Closure properties of stochastic languages, Technical Report TR441. Department of Computer Science, University of Rochester, 1993
30. Michel P. An NP-complete language accepted in linear time by a one-tape Turing machine. Theoret. Comput. Sci. 85 (1991) 205-212
31. Nasu M., and Honda N. A context-free language which is not acceptable by a probabilistic automaton. Inform. Control 18 (1971) 233-236
32. W. Paul, N. Pippenger, E. Szemeredi, W. Trotter, On determinism versus non-determinism and related problems, in: Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 429-438
33. Paul W.J., Prauß E.J., and Reischuk R. On alternation. Acta Inform. 14 (1980) 243-255
34. Post E. Finite combinatory process-formulation I. J. Symbolic Logic 1 (1936) 103-105
35. Rabin M.O. Probabilistic automata. Inform. Control 6 (1963) 230-245
36. Selman A.L. A taxonomy of complexity classes of functions. J. Comput. System Sci. 48 (1992) 357-381
37. Turakainen P. On stochastic languages. Inform. Control 12 (1968) 304-313
38. Turakainen P. On languages representable in rational probabilistic automata. Ann. Acad. Sci. Fen. Ser. A 439 (1969) 4-10
39. Turakainen P. Generalized automata and stochastic languages. Proc. Amer. Math. Soc.. 21 (1969) 303-309
40. Turing A. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Society, Ser. 2 42 (1936) 230-265
41. Turing A. Rectification to 'On computable numbers, with an application to the Entscheidungsproblem'. R. London Math. Soc. Ser. 2 43 (1937) 544-546
42. Valiant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979) 189-201
43. T. Yamakami, Average case complexity theory, Ph.D. Dissertation, University of Toronto, 1997. Technical Report 307/97, University of Toronto. See also ECCC Thesis Listings
44. Yamakami T. A foundation of programming a multi-tape quantum Turing machine. Proc. 24th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science vol. 1672 (1999), Springer 430-441
45. Yamakami T. Analysis of quantum functions. Internat. J. Found. Comput. Sci. 14 (2003) 815-852 A preliminary version appeared in the
46. Yamakami T. Analysis of quantum functions. Proc. 19th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science vol. 1738 (1999), Springer 407-419
47. = P. Inform. Process. Lett. 71 (1999) 63-69