论文信息 - Space-bounded simulation of multitape turing machines

Space-bounded simulation of multitape turing machines

A new proof of a theorem of Hopcroft, Paul, and Valiant is presented: Every deterministic multitape Turing machine of time complexityT(n) can be simulated by a deterministic Turing machine of space complexityT(n)/logT(n). The proof includes an overlap argument.

Michael C. Loui | Leonard M. Adleman | L. Adleman | M. Loui

[1] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.

[2] Rüdiger Reischuk. A Fast Implementation of a Multidimensional Storage Into a Tree Storage , 1982, Theor. Comput. Sci..

[3] Mike Paterson. Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..

[4] M. Fischer,et al. AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION , 1974 .

[5] Jeffrey D. Ullman,et al. Relations Between Time and Tape Complexities , 1968, JACM.

[6] Wolfgang J. Paul,et al. On time versus space II , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7] James B. Morris. Formal Languages and their Relation to Automata , 1970 .