M. Baclet and C. Pagetti, Around Hopcroft???s Algorithm, Lect. Notes Comput. Sci, vol.4094, pp.114-125, 2006.
DOI : 10.1007/11812128_12

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, J. David, and C. Nicaud, REGAL: A Library to Randomly and Exhaustively Generate Automata, 12th International Conference on Implementation and Application of 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, Random generation of possibly incomplete deterministic automata, Génération Aléatoire de Structures COMbinatoires (Gascom'08), pp.31-40
URL : https://hal.archives-ouvertes.fr/hal-00452754

J. Berstel and O. Carton, On the Complexity of Hopcroft???s State Minimization Algorithm, CIAA'2004, pp.35-44, 2004.
DOI : 10.1007/978-3-540-30500-2_4

J. A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, Proc. Symp. on. the Mathematical Theory of Automata of MRI Symposia Series, pp.529-561, 1962.

J. Champarnaud, A. Khorsi, and T. Paranthoen, Split and Join for Minimizing: Brzozowski's algorithm PSC'02 Proceedings, Prague Stringology Conference, pp.96-104, 2002.

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

D. Gries, Describing an Algorithm by Hopcroft, Acta Inf, pp.97-109, 1973.
DOI : 10.1007/bf00264025

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

J. E. Hopcroft, An n log n algorithm for minimizing the states in a finite automaton, in The Theory of Machines and Computations, pp.189-196, 1971.

T. Knuutila, Re-describing an algorithm by Hopcroft, Theoretical Computer Science, vol.250, issue.1-2, pp.333-363, 2001.
DOI : 10.1016/S0304-3975(99)00150-4
URL : http://doi.org/10.1016/s0304-3975(99)00150-4

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

M. Lothaire, Applied combinatorics on words of Encyclopedia of mathematics and its application, 2005.

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, pp.231-240, 1999.
DOI : 10.1007/3-540-48340-3_21
URL : https://hal.archives-ouvertes.fr/hal-00620109

B. W. Watson, A taxonomy of algorithms for constructing minimal acyclic deterministic finite automata South African, Computer Journal, vol.27, pp.12-17, 2001.

D. Wood, Theory of Computation, 1987.