1. A.Aho, J.Hopcroft, J.Ullman, The design and analysis of computer algorithms, Addison-Wesley 1974
2. C.Alvarez, B.Jenner, A very hard log space counting problem, 5th Structure in Compl. Conf. (1990) 154–168
3. L.Banachowski, A.Kreczmar, W.Rytter, Analysis of algorithms and data structures, Addison-Wesley 1991
4. A. Bertoni, M. Goldwurm, N. Sabatini. Computing the counting function of context-free languages. In Proc. of 4th STACS, LNCS 247, 1987, pages 169–179.
5. D. Bruschi, G. Pighizzini. The complexity of computing maximal word functions. In Proc. of FCT'91, 1991, pages 157–167.