O. Bernardi, A note on Stirling numbers, preprint

F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, preprint

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

A. Denise and P. Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, Theoretical Computer Science, vol.218, issue.2, pp.233-248, 1999.
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 Ò 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 and R. Sedgewick, An introduction to the analysis of algorithms, 1996.

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

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

A. 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. A. Liskovets, The number of connected initial automata, Cybernetics, vol.5, issue.Nos. 1?2, pp.16-19, 1969.
DOI : 10.1007/BF01070908

V. A. Liskovets, Enumeration of non-isomorphic strongly connected automata, Vesci Akad, Navuk BSSR, Ser. Fiz.-Mat. Navuk, vol.3, pp.26-30, 1971.

V. A. Liskovets, Exact enumeration of acyclic automata, in FPSAC'03

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

C. E. Radke, Enumeration of strongly connected sequential machines, Information and Control, vol.8, issue.4, pp.377-389, 1965.
DOI : 10.1016/S0019-9958(65)90316-5

R. Robinson, Counting strongly connected finite automata, In Graph theory with Applications to Algorithms and Computer Science, pp.671-685, 1985.

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