1. 1. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., Time and Tape Complexity of Pushdown Automata, Information and Control, 13, 3, 1968, 186-206.0257.68065
2. 2. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., On the Computational Power of Pushdown Automata, J. Computer and System Sci., 4, 2, 1970, 129-136.2666920207.01701
3. 3. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.4135920326.68005
4. 4. BEERI C., Reductions in the Number of Heads for the Nondeterminancy Problem in Multihead Automata, Technical Report, Institute of Mathematics, The Hebrew Institute of Jerusalem, Israel.
5. 5. BOOK R., Translational Lemmas, Polynomial Time, and (Log (n))j-Space, Theoretical Computer Science, 1, 1976, 215-226.4059180326.68030