On two-way multihead automata. (English) Zbl 0256.68028


68Q45 Formal languages and automata
Full Text: DOI


[1] Harrison, M. A.; Ibarra, O. H., Multi-tape and multi-head pushdown automata, Information and Control, 13, 433-470 (1968) · Zbl 0174.02701
[2] Ibarra, O. H., Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata, J. Comput. Systems Sci., 5, 88-117 (1971) · Zbl 0255.68012
[3] Ibarra, O. H., A note concerning nondeterministic tape complexities, J. Assoc. Comput. Mach., 19, 608-612 (1972) · Zbl 0245.94044
[4] Ruby, S.; Fischer, P. C., Translational methods and computational complexity, (IEEE Conference Record on Switching Circuit Theory and Logical Design. IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan (1965)), 173-178 · Zbl 0257.68037
[5] Cook, S. A., A hierarchy for nondeterministic time complexity, (Conference Record of ACM Symposium on Theory of Computing. Conference Record of ACM Symposium on Theory of Computing, Denver, Colorado (1972)), 187-192 · Zbl 0361.68074
[6] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., Time and tape complexity of pushdown automaton languages, Information and Control, 13, 186-206 (1968) · Zbl 0257.68065
[7] Cook, S. A., Characterizations of pushdown machines in terms of time-bounded computers, J. Assoc. Comput. Mach., 18, 4-18 (1971) · Zbl 0222.02035
[8] Hennie, F. C.; Stearns, R. E., Two-tape simulation of multitape Turing machines, J. Assoc. Comput. Mach., 13, 533-546 (1966) · Zbl 0148.24801
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.