1. 1. AHO A. V. and ULLMAN J. D., The Theory of Parsing, Translation and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs N.J., 1972.0264.68032408321
2. 2. BAKER B. S. and BOOK R. V., Reversal-Bounded Multipushdown Machines, J. Comp. System Sc., Vol. 8, 1974, pp. 315-332.3758440309.68043
3. 3. BOOK R. V., Translational Lemmas, Polynomial Time and (log n) j-Space, Theor. Comp. Sc., 1976, pp. 215-226.4059180326.68030
4. 4. BOOK R. V., Complexity Classes of Formal Languages, MFCS, 1979, pp. 43-56, Lecture Notes in Comp. Sc., No. 74.5709740413.68045
5. 5. BOOK R. V. and BRANDENBURG F.-J., Equality Sets and Complexity Classes, S.I.A.M. J. Computing, Vol. 9, No. 4, 1980, pp. 729-743.5927640446.68040