Linear time simulation of multihead turing machines with head — To-head jumps

  • Walter J. Savitch
  • Paul M. B. Vitányi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


The main result of this paper shows that, given a Turing machine with several read-write heads per tape and which has the additional one move shift operation "shift a given head to the position of some other given head", one can effectively construct a multitape Turing machine with a single read-write head per tape which simulates it in linear time; i.e. if the original machine operates in time T(n), then the simulating machine will operate in time cT(n), for some constant c.


  1. [1]
    BOOK, R.V. & S.A. GREIBACH, Quasi-realtime languages, Math. Systems Theory 4 (1970), 97–111.Google Scholar
  2. [2]
    FISHER, P.C., A.R. MEYER & A.L. ROSENBERG, Real time simulation of multihead tape units, JACM 19 (1972) 590–607.Google Scholar
  3. [3]
    FISHER, M.J. & A.L. ROSENBERG, Limited random access Turing machines, In: Proc. 9-th SWAT, IEEE, (1968) 356–367.Google Scholar
  4. [4]
    HARTMANIS, J. & R.E. STEARNS, On the computational complexity of algorithms, Transactions of the AMS 117 (1965), 285–306.Google Scholar
  5. [5]
    HOPCROFT, J.E. & J.D. ULLMAN, Formal languages and their relation to automata, (1969), Addison-Wesley, Reading,Mass.Google Scholar
  6. [6]
    LEONG, B. & J. SEIFERAS, New real-time simulations of multihead tape units, Proc. 9th ACM Symposium on Theory of Computing (1977), (to appear).Google Scholar
  7. [7]
    STOSS, H.J., k-Band Simulation von k-Kopf Turing Maschinen, Computing 6 (1970) 309–317.Google Scholar

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • Walter J. Savitch
    • 1
  • Paul M. B. Vitányi
    • 1
  1. 1.Mathematisch CentrumAmsterdamThe Netherlands

Personalised recommendations