J. Allouche and J. Shallit, Automatic Sequences. Theory, Applications , Generalizations, 2003.

P. Arnoux and G. Rauzy, Repr??sentation g??om??trique de suites de complexit?? $2n+1$, Bulletin de la Société mathématique de France, vol.119, issue.2, pp.199-215, 1991.
DOI : 10.24033/bsmf.2164

J. Berstel, C. De-felice, D. Perrin, C. Reutenauer, and G. Rindone, Bifix codes and Sturmian words, Journal of Algebra, vol.369, pp.146-202, 2012.
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, 2009.
DOI : 10.1017/CBO9781139195768
URL : https://hal.archives-ouvertes.fr/hal-00620616

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Acyclic, connected and tree sets, Monatshefte f??r Mathematik, vol.18, issue.3???4, 2013.
DOI : 10.1007/s00605-014-0721-4

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Maximal bifix decoding, Discrete Mathematics, vol.338, issue.5, 2013.
DOI : 10.1016/j.disc.2014.12.010

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Bifix codes and interval exchanges, Journal of Pure and Applied Algebra, vol.219, issue.7, 2014.
DOI : 10.1016/j.jpaa.2014.09.028

J. Cassaigne, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc. Simon Stevin Journées Montoises, vol.4, issue.1, pp.67-88, 1994.

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

A. Glen and J. Justin, Episturmian words: a survey, RAIRO - Theoretical Informatics and Applications, vol.43, issue.3, pp.403-442, 2009.
DOI : 10.1051/ita/2009003

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

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