A. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

J. Allouche and J. Shallit, Automatic sequences, 2003.

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

J. Berstel and P. Séébold, Sturmian words, Algebraic combinatorics on words, volume 90 of Encyclopedia of Mathematics and its Applications, pp.45-110, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00620780

J. Berstel, L. Boasson, O. Carton, and I. Fagnot, A First Investigation of Sturmian Trees, Lect. Notes in Comput. Sci, vol.4393, pp.73-84, 2007.
DOI : 10.1007/978-3-540-70918-3_7
URL : https://hal.archives-ouvertes.fr/hal-00150178

N. Blum, An O(n log n) implementation of the standard method for minimizing n-state finite automata, Information Processing Letters, vol.57, issue.2, pp.65-69, 1996.
DOI : 10.1016/0020-0190(95)00199-9

J. Borel and C. Reutenauer, On Christoffel classes, RAIRO - Theoretical Informatics and Applications, vol.40, issue.1, pp.15-27, 2006.
DOI : 10.1051/ita:2005038
URL : https://hal.archives-ouvertes.fr/hal-00077704

G. Castiglione, A. Restivo, and M. Sciortino, Circular words and automata minimization, pp.79-89, 2007.

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete mathematics, 1994.

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, Theory of Machines and Computations, pp.189-196, 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

N. and P. Fogg, Substitutions in dynamics, arithmetics and combinatorics, volume 1794 of Lecture Notes in Mathematics, 2002.