A. Almeida, M. Almeida, J. Alves, N. Moreira, and R. Reis, Fado and guitar, CIAA'09, pp.65-74, 2009.

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

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

F. Bassino, J. David, and C. Nicaud, On the average complexity of Moore's state minimization algorithm, STACS'09 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.123-134, 2009.

F. Bassino, J. David, and C. Nicaud, Average Case Analysis of Moore???s State Minimization Algorithm, Algorithmica, vol.22, issue.9, pp.509-531, 2012.
DOI : 10.1007/978-3-642-15155-2_29

F. Bassino, J. David, and A. Sportiello, Asymptotic enumeration of minimal automata, STACS'12 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.88-99, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678203

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

F. Bassino and A. Sportiello, Linear-time generation of specifiable combinatorial structures: general theory and first examples. arXiv, abs, 1307.

D. Berend and A. Kontorovich, The state complexity of random DFAs. arXiv, 2013.

M. V. Berlinkov, On the probability to be synchronizable. arXiv, abs/1304, 2013.

B. Bollobás, Random Graphs, 2001.

J. A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, Mathematical theory of Automata, pp.529-561, 1962.

A. Carayol and C. Nicaud, Distribution of the number of accessible states in a random deterministic automaton, STACS'12 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik , 2012. 14. J. ? Cern´yCern´y. Poznámka k. homogénnym experimentom s konecnymi automatmi, pp.194-205
URL : https://hal.archives-ouvertes.fr/hal-00678213

J. Champarnaud, A. Khorsi, and T. Paranthoën, Split and join for minimizing: Brzozowski's algorithm, Stringology'02, pp.96-104, 2002.

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

M. Crochemore and W. Rytter, Text Algorithms, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619796

J. David, Average complexity of Moore???s and Hopcroft???s algorithms, Theoretical Computer Science, vol.417, pp.50-65, 2012.
DOI : 10.1016/j.tcs.2011.10.011

S. , D. Felice, and C. Nicaud, Brzozowski algorithm is generically super-polynomial for deterministic automata, DLT'13, pp.179-190, 2013.

D. Felice and C. Nicaud, On the Average Complexity of Brzozowski???s Algorithm for Deterministic Automata with a Small Number of Final States, DLT'14, 2014.
DOI : 10.1007/978-3-319-09698-8_3

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

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Boltzmann samplers for the random generation of combinatorial structures, Comb. Prob. Comp, vol.13, pp.4-5577, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307530

W. Feller, An Introduction to Probability Theory and Its Applications, 1968.

P. Flajolet and A. M. Odlyzko, Random Mapping Statistics, EUROCRYPT'89, pp.329-354, 1989.
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

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

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

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, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, The Theory of Machines and Computations, pp.189-196, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

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

R. M. Karp, The transitive closure of a random digraph, Random Structures and Algorithms, vol.7, issue.1, pp.73-94, 1990.
DOI : 10.1007/978-3-642-65371-1

A. Kisielewicz, J. Kowalski, and M. Szykula, A Fast Algorithm Finding the Shortest Reset Words, LNCS, vol.7936, issue.13, pp.182-196, 2013.
DOI : 10.1007/978-3-642-38768-5_18

D. E. Knuth, The Art of Computer Programming, Volume I: Fundamental Algorithms, 1997.

V. Kol?in, Random Mappings: Translation Series in Mathematics and Engineering. Translations series in mathematics and engineering, 1986.

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

E. Lebensztayn, On the asymptotic enumeration of accessible automata, DMTCS, vol.12, issue.3, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00990449

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

S. Lombardy, Y. Régis-gianas, and J. Sakarovitch, Introducing VAUCANSON, Theoretical Computer Science, vol.328, issue.1-2, pp.77-96, 2004.
DOI : 10.1016/j.tcs.2004.07.007
URL : https://hal.archives-ouvertes.fr/hal-00620038

E. F. Moore, Gedanken-Experiments on Sequential Machines, Automata Studies, pp.129-153, 1956.
DOI : 10.1515/9781400882618-006

C. Nicaud, Average State Complexity of Operations on Unary Automata, MFCS'99, pp.231-240, 1999.
DOI : 10.1007/3-540-48340-3_21
URL : https://hal.archives-ouvertes.fr/hal-00620109

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

C. Nicaud, Fast synchronization of random automata. arXiv, abs/1404, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01719171

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

D. Tabakov and M. Y. Vardi, Experimental Evaluation of Classical Automata Constructions, LPAR'05, pp.396-411, 2005.
DOI : 10.1007/11591191_28