Linear time simulation of multihead turing machines with head — To-head jumps
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.
- BOOK, R.V. & S.A. GREIBACH, Quasi-realtime languages, Math. Systems Theory 4 (1970), 97–111.
- FISHER, P.C., A.R. MEYER & A.L. ROSENBERG, Real time simulation of multihead tape units, JACM 19 (1972) 590–607.
- FISHER, M.J. & A.L. ROSENBERG, Limited random access Turing machines, In: Proc. 9-th SWAT, IEEE, (1968) 356–367.
- HARTMANIS, J. & R.E. STEARNS, On the computational complexity of algorithms, Transactions of the AMS 117 (1965), 285–306.
- HOPCROFT, J.E. & J.D. ULLMAN, Formal languages and their relation to automata, (1969), Addison-Wesley, Reading,Mass.
- LEONG, B. & J. SEIFERAS, New real-time simulations of multihead tape units, Proc. 9th ACM Symposium on Theory of Computing (1977), (to appear).
- STOSS, H.J., k-Band Simulation von k-Kopf Turing Maschinen, Computing 6 (1970) 309–317.
- Linear time simulation of multihead turing machines with head — To-head jumps
- Book Title
- Automata, Languages and Programming
- Book Subtitle
- Fourth Colloquium, University of Turku, Finland July 18–22, 1977
- pp 453-464
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.