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/s00453-011-9557-7

F. Bassino, J. David, and A. Sportiello, Asymptotic enumeration of minimal automata, Dürr and Wilke [9], pp.88-99
URL : https://hal.archives-ouvertes.fr/hal-00678203

F. Bassino, L. Giambruno, and C. Nicaud, THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES, International Journal of Foundations of Computer Science, vol.21, issue.04, pp.495-516, 2010.
DOI : 10.1142/S0129054110007398
URL : https://hal.archives-ouvertes.fr/hal-00452751

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

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, Dürr and Wilke [9], pp.194-205
URL : https://hal.archives-ouvertes.fr/hal-00678213

P. Chassaing and E. Z. Azad, Asymptotic behavior of some factorizations of random words, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00475379

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

P. Erd?-os and P. Turán, On some problems of a statistical group-theory. I, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.7, issue.2, pp.175-186, 1965.
DOI : 10.1007/BF00536750

P. Flajolet and A. M. Odlyzko, Random Mapping Statistics, Lecture Notes in Computer Science, vol.434, 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

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

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

E. Landau, Handbuch der lehre von der verteilung der primzahlen, B. G. Teubner, vol.2, 1909.

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

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