Abstract
A new and uniform technique is developed for the simulation of nondeterministic multitape Turing machines by simpler machines. For many types of restricted nondeterministic Turing machines it can now be proved that both linear time is no more powerful than real time, and multitape machines are no more powerful than machines with two tapes, one of which is a simple and normalized comparison tape. This is an improvement over all previously known simulations in terms of weaker machines. As an application we obtain that, for all such machines, the class of languages accepted in real time by multitape machines is principal and has a simple trio generator. Moreover, multitape machines with different types of tapes are hierarchically related, contrasting with the case of one-tape machines, and some important families of languages are characterized in a new way.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. S. Baker and R. V. Book, Reversal bounded multi-pushdown machines,J. Comput. System Sci.,8 (1974), 315–332.
R. V. Book, Simple representations of certain classes of languages,J. Assoc. Comput. Mach.,25 (1978), 23–31.
R. V. Book and F. J. Brandenburg, Equality sets and complexity classes,SIAM J. Comput.,9 (1980), 729–743.
R. V. Book and S. A. Greibach, Quasi-real-time languages,Math. Systems Theory,4 (1970), 97–111.
R. V. Book and M. Nivat, Linear languages and the intersection closures of classes of languages,SIAM J. Comput.,7 (1978), 167–177.
R. V. Book, S. A. Greibach, and C. Wrathall, Reset machines,J. Comput. System Sci.,19 (1979), 256–276.
R. V. Book, M. Nivat, and M. Paterson, Reversal-bounded acceptors and intersections of linear languages,SIAM. J. Comput. Sci.,7 (1978), 185–195.
F. J. Brandenburg, Multiple equality sets and Post machines,J. Comput. System Sci.,21 (1980), 292–316.
F. J. Brandenburg, Homomorphic equality operations on languages,Theoret. Computer Sci. (to appear).
A. Brandstädt and K. W. Wagner, Reversal-bounded and visit-bounded real-time computations,Proceedings of FCT 83, Lecture Notes in Computer Science, vol. 158, Springer-Verlag, Berlin, 1983, pp. 26–39.
A. Brandstädt and J. Vogel, Kompliziertheitsbeschränkte Checking- Stack-Bänder und Raum-Zeit-Probleme,Wiss. Z. Friedrich-Schiller-Univ. Jena Math.-Natur. Reihe,3 (1982), 569–577.
B. von Braumühl and R. Verbeek, Finite change automata,Proceedings of the Fourth GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science, vol. 67, Springer-Verlag, Berlin, 1979, pp. 91–100.
P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Counter machines and counter languages,Math. Systems Theory,2 (1972), 265–283.
P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Real-time simulation of multihead tape units,J. Assoc. Comput. Mach.,19 (1972), 590–607.
S. Ginsburg,Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.
S. Ginsburg and M. A. Harrison, One-way nondeterministic real-time list-storage languages,J. Assoc. Comput. Mach.,15 (1968), 428–446.
S. Ginsburg, S. A. Greibach, and M. A. Harrison, Stack automata and compiling,J. Assoc. Comput. Mach.,14 (1967), 172–201.
S. Ginsburg, S. A. Greibach, and M. A. Harrison, One-way stack automata,J. Assoc. Comput. Mach.,14 (1967), 389–418.
S. A. Greibach, Checking automata and one-way stack languages,J. Comput. System Sci.,3 (1969), 196–217.
S. A. Greibach, One-way finite visit automata,Theoret. Comput. Sci.,6 (1978), 175–221.
S. A. Greibach, Visits, crosses, and reversals for nondeterministic offline machines,Inform. and Control,36 (1978), 174–216.
S. A. Greibach, Remarks on blind and partially blind one-way multicounter machines,Theoret. Comput. Sci.,7 (1978), 311–324.
R. B. Hull, Containment between intersection families of linear and reset languages, Ph.D. Thesis, University of California, Berkeley, CA, 1979.
K. W. Wagner and G. Wechsung,Computational Complexity, VEB Deutscher Verlag der Wissenschaften, Berlin, und Reidel, Dordrecht, 1986.
G. Wechsung, Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen,Elektron. Informationsverarb. Kybernet.,12 (1976), 289–300.
G. Wechsung, The oscillation complexity and a hierarchy of context-free languages,Proceedings of FCT 79, Akademie Verlag, Berlin, 1979, pp. 508–515.
G. Wechsung and A. Brandstädt, A relation between space, return, and dual return complexities,Theoret. Comput. Sci.,9 (1979), 127–140.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brandenburg, FJ., Brandstädt, A. & Wagner, K.W. Uniform simulations of nondeterministic real time multitape turing machines. Math. Systems Theory 19, 277–299 (1986). https://doi.org/10.1007/BF01704917
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01704917