1. H. Austinat, V. Diekert, U. Hertrampf, H. Petersen, Regular frequency computations, in: Proc. RIMS Kokyuroku Symp. on Algebraic Systems, Formal Languages and Computations, vol. 1166, Research Institute for Mathematical Sciences, Kyoto University, Japan, 2000, pp. 35–42.
2. R. Beigel, Query-limited reducibilities, Ph.D. Thesis, Stanford University, January 1995.
3. Quantifying the amount of verboseness;Beigel;Inform. and Comput.,1995
4. Transductions and Context-Free Languages;Berstel;Teubner Studienbücher, Stuttgart,1979
5. A.N. Degtev, On (m,n)-computable sets, in: D.I. Moldavanskij (Ed.), Algebraic Systems, Ivanovo Gos. University, Ivanovo 1981, pp. 88–99 (in Russian) (Mathematical Reviews 86b: 03049)