On extremal properties of the Fibonacci word
RAIRO-Theor. Inf. Appl., 42 4 (2008) 701-715
Published online: 2008-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The asymptotic repetition threshold of sequences rich in palindromes
L’ubomíra Dvořáková, Karel Klouda and Edita PelantováEuropean Journal of Combinatorics 126 104124 (2025)
https://doi.org/10.1016/j.ejc.2025.104124
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
L'ubomíra Dvořáková and Edita PelantováTheoretical Computer Science 995 114490 (2024)
https://doi.org/10.1016/j.tcs.2024.114490
The repetition threshold of episturmian sequences
L’ubomíra Dvořáková and Edita PelantováEuropean Journal of Combinatorics 120 104001 (2024)
https://doi.org/10.1016/j.ejc.2024.104001
On the Complexity of the Generalized Fibonacci Words
Julien Cassaigne and Idrissa KaboréRAIRO - Theoretical Informatics and Applications 56 5 (2022)
https://doi.org/10.1051/ita/2022007
On square factors and critical factors of k-bonacci words on infinite alphabet
N. Ghareghani and P. SharifaniTheoretical Computer Science 865 34 (2021)
https://doi.org/10.1016/j.tcs.2021.02.027
An Inequality for the Number of Periods in a Word
Daniel Gabric, Narad Rampersad and Jeffrey ShallitInternational Journal of Foundations of Computer Science 32 (05) 597 (2021)
https://doi.org/10.1142/S0129054121410094
Abelian periods of factors of Sturmian words
Jarkko PeltomäkiJournal of Number Theory 214 251 (2020)
https://doi.org/10.1016/j.jnt.2020.04.007
A generalization of the Fibonacci word fractal and the Fibonacci snowflake
José L. Ramírez, Gustavo N. Rubiano and Rodrigo De CastroTheoretical Computer Science 528 40 (2014)
https://doi.org/10.1016/j.tcs.2014.02.003
Lyndon words and Fibonacci numbers
Kalle SaariJournal of Combinatorial Theory, Series A 121 34 (2014)
https://doi.org/10.1016/j.jcta.2013.09.002
SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD
ALDO DE LUCAInternational Journal of Algebra and Computation 23 (04) 705 (2013)
https://doi.org/10.1142/S0218196713400055
On the fixed points of the iterated pseudopalindromic closure operator
D. Jamet, G. Paquin, G. Richomme and L. VuillonTheoretical Computer Science 412 (27) 2974 (2011)
https://doi.org/10.1016/j.tcs.2010.03.018
Locally catenative sequences and Turtle graphics
Juhani Karhumäki and Svetlana PuzyninaRAIRO - Theoretical Informatics and Applications 45 (3) 311 (2011)
https://doi.org/10.1051/ita/2011104
Optimality of some algorithms to detect quasiperiodicities
R. Groult and G. RichommeTheoretical Computer Science 411 (34-36) 3110 (2010)
https://doi.org/10.1016/j.tcs.2010.04.039
Standard factors of Sturmian words
Gwénaël Richomme, Kalle Saari and Luca Q. ZamboniRAIRO - Theoretical Informatics and Applications 44 (1) 159 (2010)
https://doi.org/10.1051/ita/2010011
Binary words with a given Diophantine exponent
Artūras DubickasTheoretical Computer Science 410 (47-49) 5191 (2009)
https://doi.org/10.1016/j.tcs.2009.08.013
Squares and cubes in Sturmian sequences
Artūras DubickasRAIRO - Theoretical Informatics and Applications 43 (3) 615 (2009)
https://doi.org/10.1051/ita/2009005