Abstract
The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this difference cannot be exceeded.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. O. Rabin andD. Scott, Finite automata and their decision problems,Sequential Machines: Selected Papers, E. F. Moore, Ed., pp. 63–91. Addison-Wesley, Reading, Mass., 1964.
J. C. Shepherdson, The reduction of two-way automata to one-way automata,Sequential Machines: Selected Papers, E. F. Moore, Ed., pp. 92–97, Addison-Wesley, Reading, Mass., 1964.
R. M. Karp, Some bounds on the storage requirements of sequential machines and Turing machines,J. Assoc. Comput. Mach. 14 (1967), 478–489.
J. Hartmanis, P. M. Lewis, andR. E. Stearns, Hierarchies of memory limited computations, 1965IEEE Conference Record on Switching Circuit Theory and Logical Design, pp. 179–190, Ann Arbor, Michigan.
J. E. Hopcroft andJ. D. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hartmanis, J. A note on one-way and two-way automata. Math. Systems Theory 4, 24–28 (1970). https://doi.org/10.1007/BF01705881
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01705881