J. Berstel and D. Perrin, Theory of codes, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, volume 129 of Encyclopedia of Mathematics and its Applications, 2010.

J. Berstel and A. Savelli, Crochemore Factorization of Sturmian and Other Infinite Words, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.4162, pp.157-166, 2006.
DOI : 10.1007/11821069_14
URL : https://hal.archives-ouvertes.fr/hal-00620160

M. Crochemore, Recherche linéaire d'un carré dans un mot, Comptes Rendus Acad. Sci. Paris Sér. I Math, vol.296, pp.781-784, 1983.

A. De-luca, A combinatorial property of the Fibonacci words, Information Processing Letters, vol.12, issue.4, pp.193-195, 1981.
DOI : 10.1016/0020-0190(81)90099-5

A. E. Frid, S. Puzynina, and L. Q. Zamboni, On palindromic factorization of words, Advances in Applied Mathematics, vol.50, issue.5, pp.737-748, 2013.
DOI : 10.1016/j.aam.2013.01.002
URL : https://hal.archives-ouvertes.fr/hal-00865193

N. Ghareghani, M. Mohammad-noori, and P. Sharifani, On z-factorization and c-factorization of standard episturmian words, Theoretical Computer Science, vol.412, issue.39, pp.5232-5238, 2011.
DOI : 10.1016/j.tcs.2011.05.035

A. Lempel and J. Ziv, On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, vol.22, issue.1, pp.75-81, 1976.
DOI : 10.1109/TIT.1976.1055501

F. Levé and P. Séébold, Conjugation of standard morphisms and a generalization of singular words, Bulletin of the Belgian Mathematical Society, vol.10, pp.737-748, 2003.

M. Lothaire, Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and its Applications Reprinted in the Cambridge Mathematical Library, 1983.

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

Z. Wen and Z. Wen, Some properties of the singular words of the Fibonacci word, European J. Combin, vol.15, pp.587-598, 1994.