This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. N. Gray, M. A. Harrison, and O. H. Ibarra, “Two-way push-down automata,” Information and Control,11, No. 1/2 (1967).
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Time and tape complexity of push-down automaton languages,” Information and Control,1, No. 13, 186–206 (1968).
A. V. Aho and J. D. Ullman, “On the computational power of push-down automata,” J. of Computer and System Sciences,4, No. 2 (1970).
S. Ginsburg, Sh. A. Greibach, and M. A. Harrison, “Stack automata and compling,” J. of ACM,14, No. 1 (1967).
S. Ginzburg and E. H. Spanier, “Finite-turn push-down automata,” SIAM J. of Control,4, No. 3 (1966).
S. A. Cook, “Characterizations of push-down machines in terms of time-bounded computers,” J. of ACM,18, No. 1 (1971).
J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley (1969).
Additional information
Translated from Kibernetika, No. 1, pp. 40–45, January–February, 1974.
Rights and permissions
About this article
Cite this article
Barashko, A.S. Tape complexity of languages which are recognized by two-way push-down automata with a finite number of turns. Cybern Syst Anal 10, 47–53 (1974). https://doi.org/10.1007/BF01069017
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069017