F. Bassino, J. David, and C. Nicaud, On the average complexity of Moore's state minimization algorithm, 26th International Symposium on Theoretical Aspects of Computer Science Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.123-134, 2009.

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. Berstel and O. Carton, On the Complexity of Hopcroft???s State Minimization Algorithm, CIAA'O4, pp.35-44, 2004.
DOI : 10.1007/978-3-540-30500-2_4

G. Castiglione, A. Restivo, and M. Sciortino, On Extremal Cases of Hopcroft???s Algorithm, CIAA'09, pp.14-23, 2009.
DOI : 10.1016/0304-3975(85)90159-8

D. Gries, Describing an algorithm by Hopcroft, Acta Informatica, vol.2, issue.2, pp.97-109, 1973.
DOI : 10.1007/BF00264025

J. E. Hopcroft, AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON, 1971.
DOI : 10.1016/B978-0-12-417750-5.50022-1

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

F. Edward and . Moore, Gedanken experiments on sequential machines, Automata Studies, pp.129-153, 1956.

A. Nerode, Linear automaton transformations, Proc. American Mathematical Society, pp.541-544, 1958.
DOI : 10.1090/S0002-9939-1958-0135681-9