Repetitions in the Fibonacci infinite word
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1992)
- Volume: 26, Issue: 3, page 199-204
- ISSN: 0988-3754
Access Full Article
top
How to cite
topMignosi, F., and Pirillo, G.. "Repetitions in the Fibonacci infinite word." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 26.3 (1992): 199-204. <http://eudml.org/doc/92414>.
@article{Mignosi1992,
author = {Mignosi, F., Pirillo, G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {fractional power},
language = {eng},
number = {3},
pages = {199-204},
publisher = {EDP-Sciences},
title = {Repetitions in the Fibonacci infinite word},
url = {http://eudml.org/doc/92414},
volume = {26},
year = {1992},
}
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
PB - EDP-Sciences
VL - 26
IS - 3
SP - 199
EP - 204
LA - eng
KW - fractional power
UR - http://eudml.org/doc/92414
ER -
References
top- 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. Zbl0468.20049
- 3. F. DEJEAN, Sur un théorème de Thue, J. Comb. Theory, Ser. A, 1972, 13, pp. 90-99. Zbl0245.20052
- 4. J. KARHUMÄKI, On cube-free ω-words generated by binary morphism, Discr. Appl. Math., 1983, 5, pp. 279-297. Zbl0505.03022
- 5. G. H. HARDY and E. M WRIGHT, An Introduction to the theory of Numbers, Oxford University Press, Fifth edition, 1983. Zbl0020.29201MR568909
- 6. LOTHAIRE, Combinatorics on words, Addison Wesley, 1983. Zbl0514.20045MR675953
- 7. A. RESTIVO and S. SALEMI, Overlap-free words on two symbols, Lecture Notes in Compt. Sci., 1984, 192, pp. 198-206. Zbl0572.20038MR814744
- 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. JFM37.0066.17
- 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. JFM44.0462.01
Citations in EuDML Documents
top- Ashot S. Pahlevanyan, The Fibonacci automorphism of free Burnside groups
- Dalia Krieger, On critical exponents in fixed points of -uniform binary morphisms
- Ashot S. Pahlevanyan, The Fibonacci automorphism of free Burnside groups
- Giuseppe Pirillo, A hierarchy for circular codes
- Dalia Krieger, On Critical exponents in fixed points of -uniform binary morphisms
- James Currie, Narad Rampersad, Dejean's conjecture holds for N ≥ 27
- James Currie, Narad Rampersad, Infinite words containing squares at every position
- Julien Cassaigne, On extremal properties of the Fibonacci word
- Rebecca Risley, Luca Zamboni, A generalization of Sturmian sequences: Combinatorial structure and transcendence
- Amy Glen, Jacques Justin, Episturmian words: a survey
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.