1. Central and local limit theorems applied to asymptotic enumeration;Bender;J. Combin. Theory,1973
2. The distribution of subword counts is usually normal;Bender;European J. Combin.,1993
3. Rational Series and their Languages;Berstel,1988
4. A. Bertoni, C. Choffrut, M. Goldwurm, V. Lonati, The symbol-periodicity of irreducible finite automata, Rapporto Interno no. 277-02, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, April 2002 (available at http://homes.dsi.unimi.it/~goldwurm/inglese.html).
5. A. Bertoni, M. Goldwurm, M. Santini, Random generation for finitely ambiguous context-free languages, RAIRO: Theoretical Informatics and Applications, Vol. 35, 2001, pp. 499–512.