1. Aho, A. V., Hopcroft, J. E., Ullman, J. D., The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Barashko, A. S., Roizen, S. I., Kernels of partial recursive functions naming complexity classes. Kibernetika (Kiev) 5 (1976) 10–15.
3. Book, R. V., On languages accepted in polynomial time. SIAM J. Comp. 1,4 (1972) 281–287.
4. Book, R. V., Tally languages and complexity classes. Inf. and Contr. 26 (1974) 186–193.
5. Book, R. V., Translational lemmas, polynomial time and (logn)j-space. TCS 1 (1976) 215–226.