Abstract
Each multitape Turing machine, of which the storage heads scan O(log n) distinct squares in each interval of n steps, for all n ⩾ 1, can be real- time simulated by an oblivious one-head tape unit. There exist multitape Turing machines, e.g. the normal pushdown store, for which the fastest on- line simulation by an oblivious one- head tape unit requires Ω (n √n) time.
This work is registered at the Mathematical Centre.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aanderaa, S.O., [1974], On k-tape versus (k + 1)-tape real-time computation, SIAM-AMS Proceedings, Vol. 7 (Complexity of Computation), 75–96.
Fischer, P.C., A.R. Meyer & A.L. Rosenberg, [1968], Counter machines and counter languages, Math. Systems Theory, 2, 265–283.
Hennie, F.C. & R.E. Stearns, [1966], Two-tape simulation of multitape Turing machines, J. ACM, 13, 533–546.
Hopcroft, J.E. & J.D. Ullman, [1969], Formal languages and their relations to automata, Addison-Wesley.
Janiga, L., [1979], Real-time computations of two-way multihead finite automata, Fundamentals of Computation Theory (FCT '79), L. Budach ed., Akademie Verlag, Berlin, DDR, 1979, 214–218.
Paul, W., [1982], On-line simulation of k+1 tapes by k tapes requires nonlinear time, 23rd IEEE Symp. on Foundations of Computer Science, 53–56.
Paul, W., J. Seiferas & J. Simon, [1980], An information-theoretic approach to time bounds for on-line computation, 12th ACM Symp. on Theory of Computing, 357–367.
Pippenger, N. & M.J. Fischer, [1979], Relations among complexity measures, J. ACM, 26, 361–384.
Savitch, W.J. & P.M.B. Vitányi, [1982], On the power of real-time two-way multihead finite automata with jumps. Tech. Rept. CS-056, Dept. EECS, Univ. of California, San Diego.
Vitányi, P.M.B., [1980], On the power of real-time Turing machines under varying specifications, 7th Coll. on Automata, Languages and Programming (ICALP '80), Lecture Notes in Computer Science, 85, Springer Verlag, Berlin, 658–671.
Vitányi, P.M.B., [1982], Real-time simulation of multicounters by oblivious one-tape Turing machines, 14th ACM Symp. on Theory of Computing, 27–36.
Vitányi, P.M.B., [1983], An optimal simulation of counter machines: the ACM case. Tech. Rept. IW 225, Mathematisch Centrum, Amsterdam, March 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vitányi, P.M.B. (1983). On the simulation of many storage heads by a single one. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036948
Download citation
DOI: https://doi.org/10.1007/BFb0036948
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive