F. Bassino, J. David, and C. Nicaud, REGAL: A Library to Randomly and Exhaustively Generate Automata, CIAA 2007, pp.303-305, 2007.
DOI : 10.1007/978-3-540-76336-9_28
URL : https://hal.archives-ouvertes.fr/hal-00459643

J. [. Bassino, C. David, and . Nicaud, Enumeration and random generation of possibly incomplete deterministic automata, Pure Mathematics and Applications, vol.19, pp.1-16, 2009.
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

V. Carnino and S. De-felice, Random Generation of Deterministic Acyclic Automata Using Markov Chains, CIAA 2011, pp.65-75, 2011.
DOI : 10.1016/0304-3975(92)90142-3
URL : https://hal.archives-ouvertes.fr/hal-00841862

A. Carayol and C. Nicaud, Distribution of the number of accessible states in a random deterministic automaton Champarnaud and Th. Paranthoën. Random generation of dfas, STACS 2012, pp.194-205221, 2005.

. Ph, . Duchon, . Ph, G. Flajolet, G. Louchard et al., Boltzmann samplers for the random generation of combinatorial structures, Combinatorics, Probability & Computing, vol.13, pp.4-5577, 2004.

. Ph, R. Flajolet, and . Sedgewick, Analytic Combinatorics, 2008.

B. [. Finkel, P. Willems, and . Wolper, A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract), INFINITY'97, pp.27-39, 1997.
DOI : 10.1016/S1571-0661(05)80426-8

P. Flajolet, P. Zimmermann, and B. Van-cutsem, 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

[. Héam, C. Nicaud, and S. Schmitz, Parametric random generation of deterministic tree automata, Theoretical Computer Science, vol.411, issue.38-39, pp.38-393469, 2010.
DOI : 10.1016/j.tcs.2010.05.036

J. [. Hopcroft and . Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

]. D. Kor78, . D. Korshunovkor86-]-a, and . Korshunov, Enumeration of finite automata On the number of non-isomorphic strongly connected finite automata, Problemy Kibernetiki Elektronische Informationsverarbeitung und Kybernetik, vol.34, issue.229, pp.5-82459, 1978.

V. A. Liskovets, Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006.
DOI : 10.1016/j.dam.2005.06.009

]. C. Nic00 and . Nicaud, Etude du comportement en moyenne des automate finis et des langages rationnels, 2000.

C. Nicaud, Random Deterministic Automata, Mathematical Foundations of Computer Science 2014 -39th International Symposium, MFCS 2014 Proceedings, Part I, pp.5-23, 2014.
DOI : 10.1007/978-3-662-44522-8_2
URL : https://hal.archives-ouvertes.fr/hal-01226599

]. R. Rob85 and . Robinson, Counting Strongly Connected finite Automata Graph theory with Applications to Algorithms and Computer Science, pp.671-685, 1985.

]. J. Sak09 and . Sakarovitch, Elements of Automata Theory [Vys59] V. Vyssotsky. A counting problem for finite automata, 1959.