1. Ginsburg, S.: The mathematical theory of context-free languages. New York: McGraw-Hill 1966.
2. Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Addison-Wesley, Reading, Mass., 1969.
3. Savitch, W. J.: Nondederministic tape-bounded Turing machines: Doctorial thesis, Univ. of Calif., Berkeley, Calif., 1969.
4. Hartmanis, J., Lewis II, P. M., Stearns, R. E.: Hierarchies of memory limited computations. IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, p. 179?190, 1965.
5. Hennie, F. C., Stearns, R. E.: Two-tape simulation of multi-tape Turing machines. JACM 13, 533?546 (1966).