]. F. Bassino and C. Nicaud, Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers, International Colloquium on Mathematics and Computer Science Discrete Mathematics and Theoretical Computer Science Proceedings, issue.1, pp.151-160, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00619870

]. O. Bernardi, A note on Stirling numbers, preprint

R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth, On the LambertW function, Advances in Computational Mathematics, vol.1, issue.6, pp.329-359, 1996.
DOI : 10.1007/BF02124750

A. Denise and P. Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, [6] L. Devroye, Non-uniform random variate generation, pp.233-248, 1986.
DOI : 10.1016/S0304-3975(98)00323-5
URL : https://hal.archives-ouvertes.fr/inria-00073447

M. Domaratzki, D. Kisman, and J. Shallit, On the number of distinct languages accepted by finite automata with n states, J. Autom. Lang. Comb, issue.4, pp.469-486, 2002.

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, E. Fusy, and C. Pivoteau, Boltzmann Sampling of Unlabelled Structures, Proceedings of ANALCO'07 (Analytic Combinatorics and Algorithms) Conference, 2007.
DOI : 10.1137/1.9781611972979.5
URL : https://hal.archives-ouvertes.fr/hal-00782866

P. Flajolet and R. Sedgewick, An introduction to the analysis of algorithms, 1996.

P. Flajolet and R. Sedgewick, Analytic combinatorics, Book in preparation, 2007.

P. Flajolet, P. Zimmermann, and B. , A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

I. 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

]. M. Harrison, A census of finite automata, Journal canadien de math??matiques, vol.17, issue.0, pp.100-113, 1965.
DOI : 10.4153/CJM-1965-010-9

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

D. Korshunov, Enumeration of finite automata, Problemy Kibernetiki, vol.34, pp.5-82, 1978.

A. D. Korshunov, On the number of non-isomorphic strongly connected finite automata, Journal of Information Processing and Cybernetics, vol.9, pp.459-462, 1986.

V. Liskovets, The number of connected initial automata, Cybernetics, vol.5, issue.Nos. 1?2, pp.16-19, 1969.
DOI : 10.1007/BF01070908

J. Sakarovitch, Eléments de théorie des automates, Vuibert English translation: Elements of Automata Theory, 2003.

V. Vyssotsky, A counting problem for finite automata, 1959.

]. S. Yu, Q. Zhuang, and K. Salomaa, The state complexities of some basic operations on regular languages, Theoretical Computer Science, vol.125, issue.2, pp.315-328, 1994.
DOI : 10.1016/0304-3975(92)00011-F