]. Balková, E. Pelantová, and W. Steiner, Sequences with constant number of return words, Monatshefte f??r Mathematik, vol.22, issue.3-4, pp.3-4251, 2008.
DOI : 10.1007/s00605-008-0001-2

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/s00605-014-0721-4

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, pp.2781-2798, 2015.
DOI : 10.1016/j.jpaa.2014.09.028

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

V. Berthé, C. De-felice, V. Delecroix, F. Dolce, J. Leroy et al., Specular sets, Combinatorics on Words -10th International Conference, WORDS 2015 Proceedings., volume 9304 if Lecture Notes in Computer Science, pp.210-222, 2015.

V. Berthé, V. Delecroix, F. Dolce, D. Perrin, C. Reutenauer et al., Return words of linear involutions and fundamental groups, Ergodic Theory and Dynamical Systems, vol.34, issue.03, 2015.
DOI : 10.1017/S0143385700008580

V. Berthé and M. Rigo, Combinatorics, automata and number theory, Encyclopedia Math. Appl. Cambridge Univ. Press, vol.135, 2010.
DOI : 10.1017/CBO9780511777653

A. Blondin-massé, S. Brlek, S. Labbé, and L. Vuillon, Palindromic complexity of codings of rotations, Theoretical Computer Science, vol.412, issue.46, pp.6455-6463, 2011.
DOI : 10.1016/j.tcs.2011.08.007

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

F. Dolce and D. Perrin, Enumeration Formul?? in Neutral Sets, Developments in Language Theory -19th International Conference Proceedings., volume 9168 of Lecture Notes in Computer Science, pp.215-227, 2015.
DOI : 10.1007/978-3-319-21500-6_17

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. Keane, Interval exchange transformations, Mathematische Zeitschrift, vol.141, issue.1, pp.25-31, 1975.
DOI : 10.1007/BF01236981

A. Nogueira, B. Pires, and S. Troubetzkoy, Orbit structure of interval exchange transformations with flip, Nonlinearity, vol.26, issue.2, pp.525-537, 2013.
DOI : 10.1088/0951-7715/26/2/525

URL : https://hal.archives-ouvertes.fr/hal-00965040

L. Vuillon, On the number of return words in infinite words constructed by interval exchange transformations, Pure Math. Appl. (PU.M.A.), vol.18, pp.3-4345, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00387963