\begin{thebibliography}{10}

\bibitem{Ber}
J.~Berstel, Fibonacci words, a survey.
\newblock In G.~Rozenberg and A.~Salomaa, editors, {\em The Book of L}, pp.
  11--25. Springer-Verlag, 1985.

\bibitem{BerCoFib}
J.~Berstel, On the index of {S}turmian words.
\newblock In Juhani Karhum\"{a}ki, Hermann Maurer, Gheorghe P\v{a}�un, and
  Grzegorz Rozenberg, editors, {\em Jewels are Forever}, pp.  287--294.
  Springer Berlin Heidelberg, 1999.

\bibitem{BeSa06}
J.~Berstel and A.~Savelli, Crochemore factorization of {S}turmian and other
  infinite words, In {\em Mathematical Foundations of Computer Science}, Vol.
  4162 of {\em Lecture Notes in Computer Science}, pp.  157--166. Springer,
  Berlin, 2006.

\bibitem{CFL58}
K.~T. Chen, R.~H. Fox, and R.~C. Lyndon, Free differential calculus, {IV} - the
  quotient groups of the lower central series, {\em Ann. Math.} {\bf 68}
  (1958), 81--95.

\bibitem{del95}
A.~de~Luca, A division property of the {F}ibonacci word, {\em Inform. Process.
  Letters} {\bf 54} (1995), 307--312.

\bibitem{DelDel06a}
A.~de~Luca and A.~De~Luca, Combinatorial properties of {Sturmian} palindromes,
  {\em Internat. J. Found. Comput. Sci.} {\bf 17} (2006), 557--573.

\bibitem{DelFi13}
A.~De~Luca and G.~Fici, Open and closed prefixes of {S}turmian words, In {\em
  Proceedings of the 9th International Conference on Words}, Vol. 8079 of {\em
  Lecture Notes in Computer Science}, pp.  132--142. Springer Berlin
  Heidelberg, 2013.

\bibitem{Lek}
C.~G. Lekkerkerker, Voorstelling van natuurlijke getallen door een som van
  {F}ibonacci, {\em Simon Stevin} {\bf 29} (1951-52), 190--195.

\bibitem{Me99}
G.~Melan\c{c}on, Lyndon words and singular factors of {S}turmian words, {\em
  Theoret. Comput. Sci.} {\bf 218} (1999), 41--59.

\bibitem{Ostr}
A.~Ostrowski, Bemerkungen zur theorie der diophantischen approximationen, {\em
  Abh. Math. Sem. Hamburg} {\bf 1} (1922), 250--251.
\newblock Reprinted in Collected Mathematical Papers, Vol. 3, pp. 57--80.

\bibitem{SiMaDaSu94}
R.~Siromoney, L.~Matthew, V.~R. Dare, and K.~G. Subramanian, Infinite {L}yndon
  words, {\em Inform. Process. Letters} {\bf 50} (1994), 101--104.

\bibitem{WenWen94}
Z.-X. Wen and Z.-Y. Wen, Some properties of the singular words of the
  {F}ibonacci word, {\em European J. Combin.} {\bf 15} (1994), 587--598.

\bibitem{Zeck}
\'{E}. Zeckendorf, Repr�sentation des nombres naturels par une somme de nombres
  de {F}ibonacci ou de nombres de {L}ucas, {\em Bull. Soc. Roy. Sci. Li\`{e}ge}
  {\bf 41} (1972), 179--182.

\bibitem{LZ77}
J.~Ziv and A.~Lempel, A universal algorithm for sequential data compression,
  {\em IEEE Trans. Inf. Theor.} {\bf 23}(3) (1977), 337--343.

\end{thebibliography}
