J. Berstel, C. De-felice, D. Perrin, and G. Rindone, On the groups of codes with empty kernel, Semigroup Forum, vol.8, issue.R-1, pp.351-374, 2010.
DOI : 10.1007/s00233-010-9214-5
URL : https://hal.archives-ouvertes.fr/hal-00790630

J. Berstel, C. De-felice, D. Perrin, C. Reutenauer, and G. Rindone, Bifix codes and Sturmian words, Journal of Algebra, vol.369, p.13, 2011.
DOI : 10.1016/j.jalgebra.2012.07.013
URL : https://hal.archives-ouvertes.fr/hal-00793907

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata Já? Cern´yCern´y. Poznamka k homogenym s konecnymi automati, Mat.-fyz. cas. SAV, vol.14, issue.4, pp.208-215, 1964.
DOI : 10.1017/cbo9781139195768

X. Droubay, J. Justin, and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy, Theoretical Computer Science, vol.255, issue.1-2, pp.539-553, 2001.
DOI : 10.1016/S0304-3975(99)00320-5

V. Froidure and J. Pin, Algorithms for computing finite semigroups, Foundations of computational mathematics, pp.112-126, 1997.
DOI : 10.1007/978-3-642-60539-0_9
URL : https://hal.archives-ouvertes.fr/hal-00143949

W. Michael and L. Holcombe, Algebraic Automata Theory, 1982.

J. Justin and L. Vuillon, Return words in Sturmian and episturmian words, RAIRO - Theoretical Informatics and Applications, vol.34, issue.5, pp.343-356, 2000.
DOI : 10.1051/ita:2000121

G. Lallement, Semigroups and combinatorial applications, p.7, 1979.

M. Lothaire, Combinatorics on Words, p.11, 1997.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. Lothaire, Algebraic Combinatorics on Words, p.13, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

C. Roger, P. E. Lyndon, and . Schupp, Combinatorial Group Theory, p.9, 1977.

D. Perrin, Sur les groupes dans les mono¨?desmono¨?des finis, Noncommutative Structures in Algebra and Geometric Combinatorics, pp.27-36, 1978.

D. Perrin and G. Rindone, On syntactic groups, Bull. Belg. Math. Soc. Simon Stevin, vol.10, issue.2, pp.749-759, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00790638

M. Schützenberger, A property of finitely generated submonoids of free monoids, Algebraic theory of semigroups (Proc. Sixth Algebraic Conf, pp.545-576, 1976.

J. Stern, Complexity of some problems from the theory of automata, Information and Control, vol.66, issue.3, pp.163-176, 1985.
DOI : 10.1016/S0019-9958(85)80058-9

A. Trakhtman, Th? Cern´yCern´y conjecture for aperiodic automata, Discrete Mathematics & Theoretical Computer Science, vol.9, issue.2, p.19, 2007.