×

Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. (English) Zbl 0255.68012


MSC:

68Q25 Analysis of algorithms and problem complexity
03D10 Turing machines and related notions
68Q45 Formal languages and automata
68U20 Simulation (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Hopcroft, J. E.; Ullman, J. D., An approach to a unified theory of automata, Bell System Technical J., 46, 1793-1829 (1967) · Zbl 0155.34303
[2] Ginsburg, S.; Greibach, S. A.; Harrison, M. A., Stack automata and compiling, J. Assoc. Comput. Mach., 14, 173-201 (1967) · Zbl 0153.01101
[3] Hopcroft, J. E.; Ullman, J. D., (Formal Languages and Their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, Mass.) · Zbl 0196.01701
[4] Cook, S. A., Variations on pushdown machines, J. Assoc. Comput. Mach., 18, 4-18 (1971) · Zbl 0222.02035
[5] Greibach, S. A., Checking automata and one-way stack languages, J. Comput. Systems Sci., 3, 196-217 (1969) · Zbl 0174.02702
[6] Fischer, M. J., Two Characterizations of the Context-Sensitive Languages, (IEEE Conference Record of the Tenth Annual Symposium on Switching and Automata Theory. IEEE Conference Record of the Tenth Annual Symposium on Switching and Automata Theory, Waterloo, Ontario, Canada (1969)), 149-156
[7] Hopcroft, J. E.; Ullman, J. D., Nonerasing stack automata, J. Comput. Systems Sci., 1, 166-186 (1967) · Zbl 0166.00506
[8] Savitch, W. J., Relationships between nondeterministic and deterministic tape complexities, J. Comput. Systems Sci., 4, 177-192 (1970) · Zbl 0188.33502
[9] Stearns, R. E.; Hartmanis, J.; Lewis, P. M., Hierarchies of Memory Limited Computations, (IEEE Conference Record on Switching Circuit Theory and Logical Design. IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan (1965)), 179-190 · Zbl 0229.02033
[10] Hennie, F. C.; Stearns, R. E., Two tape simulation of multitape Turing machines, J. Assoc. Comput. Mach., 13, 533-546 (1966) · Zbl 0148.24801
[11] Ullman, J. D., Halting stack automata, J. Assoc. Comput. Mach., 16, 550-563 (1969) · Zbl 0215.60605
[12] Giuliano, J. A., Writing Stack Acceptors, (IEEE Conference Record of the Eleventh Annual Symposium on Switching and Automata Theory. IEEE Conference Record of the Eleventh Annual Symposium on Switching and Automata Theory, Santa Monica, California (1970)), 181-193 · Zbl 0242.68023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.