Abstract.
We prove an O(t(n)d (t(n)) ½ / log t(n)) time bound for the sim-ulation of t(n) steps of a Turing machine using several one-dimensional work tapes on a Turing machine using one d-dimensional work tape, \( d \ge 2 \). We prove a matching lower bound which holds for the problem of recognizing languages on machines with a separate one-way input tape.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: March 1995.
Rights and permissions
About this article
Cite this article
Dietzfelbinger, M., Hühne, M. Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Comput. complex. 8, 371–392 (1999). https://doi.org/10.1007/s000370050006
Issue Date:
DOI: https://doi.org/10.1007/s000370050006