M. Almeida, N. Moreira, and R. Reis, Enumeration and generation with a string automata representation, Theoretical Computer Science, vol.387, issue.2, pp.93-102, 2007.
DOI : 10.1016/j.tcs.2007.07.029
URL : http://doi.org/10.1016/j.tcs.2007.07.029

F. Bassino, J. David, and C. Nicaud, Enumeration and random generation of possibly incomplete deterministic automata, Pure Math. and Appl, vol.19, pp.1-16, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00452748

F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, Theoretical Computer Science, vol.381, issue.1-3, pp.86-104, 2007.
DOI : 10.1016/j.tcs.2007.04.001
URL : https://hal.archives-ouvertes.fr/hal-00459712

M. Champarnaud and T. Paranthoën, Random generation of DFAs, Theoretical Computer Science, vol.330, issue.2, pp.221-235, 2005.
DOI : 10.1016/j.tcs.2004.03.072

R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W function, Adv. Comp. Math, pp.329-359, 1996.

J. David, The Average Complexity of Moore's State Minimization Algorithm is O(n log log n), Proc. of MFCS '10, pp.318-329, 2010.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745
URL : https://hal.archives-ouvertes.fr/hal-00654267

P. Flajolet and A. M. Odlyzko, Random Mapping Statistics, In Adv. Crypt, pp.329-354, 1990.
DOI : 10.1007/3-540-46885-4_34
URL : https://hal.archives-ouvertes.fr/inria-00075445

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

F. Bassino, J. David, and A. Sportiello, Asymptotic Enumeration of Minimal Automata, Proc. of STACS '12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678203

I. J. Good, An Asymptotic Formula for the Differences of the Powers at Zero, The Annals of Mathematical Statistics, vol.32, issue.1, pp.249-256, 1961.
DOI : 10.1214/aoms/1177705156

E. John, J. Hopcroft, and . Ullman, Introduction to automata theory, languages and computation, 1980.

A. Korshunov, Enumeration of finite automata 15 Elcio Lebensztayn. On the asymptotic enumeration of accessible automata, Problemy Kibernetiki Discr. Math. & Theor. Comp. Sc, vol.34, issue.123, pp.5-8275, 1978.

A. Valery and . Liskovets, The number of initially connected automata, Cybernetics Kibernetika, vol.4, issue.3, pp.259-262, 1969.

C. Nicaud, Comportement en moyenne des automates finis et des langages rationnels, 2000.

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, 1978.