J. Almeida and A. Costa, ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS, International Journal of Algebra and Computation, vol.129, issue.02, p.1250018, 2012.
DOI : 10.1007/978-1-4613-2215-3

J. Almeida and A. Costa, Presentations of Sch??tzenberger groups of minimal subshifts, Israel Journal of Mathematics, vol.176, issue.1, pp.1-31, 2013.
DOI : 10.1007/s11856-010-0023-z
URL : http://www.fc.up.pt/cmup/jalmeida/preprints/Almeida-Costa_Presentations_of_Schutzenberger_groups_of_subshifts.pdf

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, pp.521-550, 2015.
DOI : 10.1007/BF02574174

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., The finite index basis property, Journal of Pure and Applied Algebra, vol.219, issue.7, pp.2521-2537, 2015.
DOI : 10.1016/j.jpaa.2014.09.014

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

A. Carpi and A. De-luca, Codes of central Sturmian words, Theoretical Computer Science, vol.340, issue.2, pp.220-239, 2005.
DOI : 10.1016/j.tcs.2005.03.021
URL : https://doi.org/10.1016/j.tcs.2005.03.021

T. Colcombet, Green???s Relations and Their Use in Automata Theory, Language and Automata Theory and Applications -5th International Conference Proceedings, pp.1-21, 2011.
DOI : 10.1007/3-540-54233-7_166

F. Dolce and D. Perrin, Enumeration Formul?? in Neutral Sets, DLT 2015, 2015.
DOI : 10.1007/978-3-319-21500-6_17
URL : http://arxiv.org/pdf/1503.06081

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
URL : https://doi.org/10.1016/s0304-3975(99)00320-5

D. Perrin and P. Schupp, Automata on the integers, recurrence, distinguishability , and the equivalence of monadic theories, LICS 1986, pp.301-304, 1986.

A. Restivo, Codes and local constraints, Theoretical Computer Science, vol.72, issue.1, pp.55-64, 1990.
DOI : 10.1016/0304-3975(90)90046-K
URL : https://doi.org/10.1016/0304-3975(90)90046-k

C. Reutenauer, Ensembles libres de chemins dans un graphe, Bulletin de la Société mathématique de France, vol.79, issue.2, pp.135-152, 1986.
DOI : 10.24033/bsmf.2051
URL : http://www.numdam.org/article/BSMF_1986__114__135_0.pdf