P. Ambro?, A. Frid, and Z. , Masákováa n dE .P e l a n t o v ´ a, On the number of factors in codings of three interval exchange, Discr. Math. Theoret. Comput. Sci, vol.13, pp.51-66, 2011.

C. A. Berenstein, L. N. Kanal, D. Lavine, and E. C. Olson, A geometric approach to subpixel registration accuracy, Computer Vision, Graphics, and Image Processing, vol.40, issue.3, pp.334-360, 1987.
DOI : 10.1016/S0734-189X(87)80146-9

J. Berstel and M. Pocchiola, A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS, International Journal of Algebra and Computation, vol.03, issue.03, pp.349-355, 1993.
DOI : 10.1142/S0218196793000238
URL : https://hal.archives-ouvertes.fr/hal-00619494

J. Berstel and M. Pocchiola, Random generation of finite Sturmian words, Discrete Mathematics, vol.153, issue.1-3, pp.29-39, 1996.
DOI : 10.1016/0012-365X(95)00125-G
URL : https://hal.archives-ouvertes.fr/hal-00619892

J. Berstel and L. Vuillon, Coding rotations on intervals, Theoretical Computer Science, vol.281, issue.1-2, pp.99-107, 2002.
DOI : 10.1016/S0304-3975(02)00009-9
URL : https://hal.archives-ouvertes.fr/hal-00619502

J. Cassaigne and A. E. Frid, On the arithmetical complexity of Sturmian words, Theoretical Computer Science, vol.380, issue.3, pp.304-316, 2007.
DOI : 10.1016/j.tcs.2007.03.022

A. Frid, A lower bound for the arithmetical complexity of Sturmian words, Siberian Electron, Math. Rep, vol.2, pp.14-22, 2005.

E. P. Lipatov, A classification of binary collections and properties of homogeneity classes, Problemy Kibernet, vol.39, pp.67-84, 1982.

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

F. Mignosi, On the number of factors of Sturmian words, Theoretical Computer Science, vol.82, issue.1, pp.71-84, 1991.
DOI : 10.1016/0304-3975(91)90172-X

G. Rote, Sequences With Subword Complexity 2n, Journal of Number Theory, vol.46, issue.2, pp.196-213, 1994.
DOI : 10.1006/jnth.1994.1012