1. Bellantoni, S.: Predicative recursion and computational complexity. PhD thesis, University of Toronto (1992)
2. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions (1992)
3. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007),
http://www.grappa.univ-lille3.fr/tata
4. Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput. 9(3), 636–652 (1980)
5. Cousineau, G.: An algebraic definition for control structures. Theoretical Computer Science 12, 175–192 (1980)