no. 3
Repetitions in the Fibonacci infinite word
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 3, pp. 199-204. 
@article{ITA_1992__26_3_199_0,
     author = {Mignosi, F. and Pirillo, G.},
     title = {Repetitions in the {Fibonacci} infinite word},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {199--204},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {3},
     year = {1992},
     mrnumber = {1170322},
     zbl = {0761.68078},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1992__26_3_199_0/}
}
TY  - JOUR
AU  - Mignosi, F.
AU  - Pirillo, G.
TI  - Repetitions in the Fibonacci infinite word
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 199
EP  - 204
VL  - 26
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1992__26_3_199_0/
LA  - en
ID  - ITA_1992__26_3_199_0
ER  - 
%0 Journal Article
%A Mignosi, F.
%A Pirillo, G.
%T Repetitions in the Fibonacci infinite word
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 199-204
%V 26
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1992__26_3_199_0/
%G en
%F ITA_1992__26_3_199_0
Mignosi, F.; Pirillo, G. Repetitions in the Fibonacci infinite word. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 3, pp. 199-204. http://www.numdam.org/item/ITA_1992__26_3_199_0/

1. J. Berstel, Mots de Fibonacci, Séminaire d'informatique théorique, L.I.T.P., Paris, Année 1980/198, pp. 57-78.

2. A. De Luca, A combinatorial property of the Fibonacci words, Inform. Process. Lett., 1981, 12, n. 4, pp. 193-195. | Zbl

3. F. Dejean, Sur un théorème de Thue, J. Comb. Theory, Ser. A, 1972, 13, pp. 90-99. | Zbl

4. J. Karhumäki, On cube-free ω-words generated by binary morphism, Discr. Appl. Math., 1983, 5, pp. 279-297. | Zbl

5. G. H. Hardy and E. M Wright, An Introduction to the theory of Numbers, Oxford University Press, Fifth edition, 1983. | MR

6. Lothaire, Combinatorics on words, Addison Wesley, 1983. | MR | Zbl

7. A. Restivo and S. Salemi, Overlap-free words on two symbols, Lecture Notes in Compt. Sci., 1984, 192, pp. 198-206. | MR | Zbl

8. P. Séébold, Propriétés combinatoires des mots infinis engendrés par certains morphismes, Thèse de doctorat, Rapp. Tec. L.I.T.P., 85-14 1985.

9. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana 1906, Nr. 7. pp. 1-22. | JFM

10. A. Thue, Über die gegenseitige Lege gleicher Teile gewisser Zeichenrein, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana 1912, Nr. 1, pp. 1-67. | JFM