A. Apostolico and . Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoretical Computer Science, vol.119, issue.2, pp.247-265, 1993.
DOI : 10.1016/0304-3975(93)90159-Q

G. Arnoux and . 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

. Berstel, Fibonacci Words ??? A Survey, The book of L, 1986.
DOI : 10.1007/978-3-642-95486-3_2

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

S. Brodal and C. N. Pedersen, Finding Maximal Quasiperiodicities in Strings, Combinatorial Pattern Matching 11th Annual Symposium, pp.397-411, 2000.
DOI : 10.1007/3-540-45123-4_33

M. Christou, I. Crochemore, and S. Costas, Quasiperiodicities in Fibonacci strings, ArXiv, 2002.

. De-luca, Sturmian words: structure, combinatorics, and their arithmetics, Theoretical Computer Science, vol.183, issue.1, pp.45-82, 1997.
DOI : 10.1016/S0304-3975(96)00310-6

. Fischler, Palindromic prefixes and episturmian words, Journal of Combinatorial Theory, Series A, vol.113, issue.7, pp.1281-1304, 2006.
DOI : 10.1016/j.jcta.2005.12.001

G. Gamard and . Richomme, Coverability in Two Dimensions, Language and Automata Theory and Applications -9th International Conference, LATA 2015 Proceedings, pp.402-413, 2015.
DOI : 10.1007/978-3-319-15579-1_31

URL : https://hal.archives-ouvertes.fr/lirmm-01180026

F. Glen, G. Levé, and . Richomme, Quasiperiodic and Lyndon episturmian words, Theoretical Computer Science, vol.409, issue.3, pp.578-600, 2008.
DOI : 10.1016/j.tcs.2008.09.056

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

G. Groult and . Richomme, Optimality of some algorithms to detect quasiperiodicities, Theoretical Computer Science, vol.411, issue.34-36, pp.3110-3122, 2010.
DOI : 10.1016/j.tcs.2010.04.039

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

S. Iliopoulos and L. Mouchard, An o(n log n) algorithm for computing all maximal quasiperiodicities in strings, Combinatorics, Computation and Logic. Proceedings of DMTCS'99 and CATS'99, pp.262-272, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00465077

J. and G. Pirillo, Episturmian words and episturmian morphisms, Theor. Comput. Sci, vol.276, issue.12, pp.281-313, 2002.

G. Levé and . Richomme, Quasiperiodic infinite words: some answers, Bull. Europ. Assoc. Theoret. Comput. Sci, vol.84, pp.128-238, 2004.

G. Levé and . Richomme, Quasiperiodic Sturmian words and morphisms, Theoretical Computer Science, vol.372, issue.1, pp.15-25, 2007.
DOI : 10.1016/j.tcs.2006.10.034

. Lothaire, Reprinted in the Cambridge Mathematical Library, of Encyclopedia of Mathematics and its Applications, 1983.

. Lothaire, Algebraic Combinatorics on Words, volume 90 of Encyclopedia of Mathematics and its Applications, 2002.

. Marcus, Quasiperiodic infinite words, Bull. Eur. Assoc. Theor. Comput. Sci, vol.82, pp.170-174, 2004.

S. Monteil and . Marcus, Quasiperiodic infinite words: multi-scale case and dynamical properties. arXiv:math/0603354v1, 2006.

. Mouchard, Normal forms of quasiperiodic strings, Theoretical Computer Science, vol.249, issue.2, pp.313-324, 2000.
DOI : 10.1016/S0304-3975(00)00065-7

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

L. Mousavi, J. Schaeffer, and . Shallit, Decision algorithms for Fibonacci-automatic words, I: basic results. RAIRO Theor, Inform. Appl