1. J. Berstel, Transductions And Context-Free Languages, Teubner, Stuttgart, 1979
2. P. Flajolet, J.M. Steyart, Complexity Of Classes Of Languages And Operators, IRIA Rapport De Recherche No 92, 1974
3. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Fransisco, 1979
4. S. Ginsburg, G. Rozenberg, TOL schemes and control sets, Inform. and Control 27 (1974), 109–125
5. J. Hartmanis, Feasible Computations and Provable Complexity Properties, SIAM Monographie, Philadelphia, 1978