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
URL : http://www-lipn.univ-paris13.fr/%7Ebassino/publications/algorithmica09.pdf

F. Bassino, J. David, and A. Sportiello, Asymptotic enumeration of minimal automata, pp.88-99
URL : https://hal.archives-ouvertes.fr/hal-00678203

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

P. Chassaing and J. Marckert, Parking functions, empirical processes, and the width of rooted labeled trees, Electron. J. Combin, vol.8, issue.1, 2001.

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, Developments in Language Theory, pp.179-190, 2013.
DOI : 10.1007/978-3-642-38771-5_17

S. D. Felice and C. Nicaud, On the Average Complexity of Brzozowski???s Algorithm for Deterministic Automata with a Small Number of Final States, Developments in Language Theory -18th International Conference, DLT 2014 Proceedings, volume 8633 of Lecture Notes in Computer Science, pp.25-36, 2014.
DOI : 10.1007/978-3-319-09698-8_3

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

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

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-01772890

G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory. Cambridge Studies in Advanced Mathematics, 1995.
DOI : 10.1090/gsm/163
URL : https://hal.archives-ouvertes.fr/hal-01281339