Repetitions in the Fibonacci infinite word
RAIRO-Theor. Inf. Appl., 26 3 (1992) 199-204
Published online: 2017-02-01
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
Properties of a ternary infinite word
James Currie, Pascal Ochem, Narad Rampersad and Jeffrey ShallitRAIRO - Theoretical Informatics and Applications 57 1 (2023)
https://doi.org/10.1051/ita/2022010
Abelian combinatorics on words: A survey
Gabriele Fici and Svetlana PuzyninaComputer Science Review 47 100532 (2023)
https://doi.org/10.1016/j.cosrev.2022.100532
Prefixes of the Fibonacci word that end with a cube
Narad RampersadComptes Rendus. Mathématique 361 (G1) 323 (2023)
https://doi.org/10.5802/crmath.408
Lie complexity of words
Jason P. Bell and Jeffrey ShallitTheoretical Computer Science 927 98 (2022)
https://doi.org/10.1016/j.tcs.2022.06.001
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
Automatic complexity of Fibonacci and Tribonacci words
Bjørn Kjos-HanssenDiscrete Applied Mathematics 289 446 (2021)
https://doi.org/10.1016/j.dam.2020.10.014
Critical exponents of infinite balanced words
Narad Rampersad, Jeffrey Shallit and Élise VandommeTheoretical Computer Science 777 454 (2019)
https://doi.org/10.1016/j.tcs.2018.10.017
Rich square-free words
Jetro VestiTheoretical Computer Science 687 48 (2017)
https://doi.org/10.1016/j.tcs.2017.05.003
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
Yuke Huang and Zhiying WenDiscrete Applied Mathematics 230 78 (2017)
https://doi.org/10.1016/j.dam.2017.06.012
Abelian-square-rich words
Gabriele Fici, Filippo Mignosi and Jeffrey ShallitTheoretical Computer Science 684 29 (2017)
https://doi.org/10.1016/j.tcs.2017.02.012
Abelian powers and repetitions in Sturmian words
Gabriele Fici, Alessio Langiu, Thierry Lecroq, et al.Theoretical Computer Science 635 16 (2016)
https://doi.org/10.1016/j.tcs.2016.04.039
Combinatorics on Words
Gabriele Fici and Filippo MignosiLecture Notes in Computer Science, Combinatorics on Words 9304 122 (2015)
https://doi.org/10.1007/978-3-319-23660-5_11
Searching for Zimin patterns
Wojciech Rytter and Arseny M. ShurTheoretical Computer Science 571 50 (2015)
https://doi.org/10.1016/j.tcs.2015.01.004
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
https://doi.org/10.1002/9781119008200.biblio
https://doi.org/10.1002/9781119042853.biblio
Developments in Language Theory
Gabriele Fici, Alessio Langiu, Thierry Lecroq, et al.Lecture Notes in Computer Science, Developments in Language Theory 7907 227 (2013)
https://doi.org/10.1007/978-3-642-38771-5_21
On a generalization of Abelian equivalence and complexity of infinite words
Juhani Karhumaki, Aleksi Saarela and Luca Q. ZamboniJournal of Combinatorial Theory, Series A 120 (8) 2189 (2013)
https://doi.org/10.1016/j.jcta.2013.08.008
The maximal number of cubic runs in a word
M. Crochemore, C.S. Iliopoulos, M. Kubica, et al.Journal of Computer and System Sciences 78 (6) 1828 (2012)
https://doi.org/10.1016/j.jcss.2011.12.005
Developments in Language Theory
Narad Rampersad and Elise VasletLecture Notes in Computer Science, Developments in Language Theory 6795 441 (2011)
https://doi.org/10.1007/978-3-642-22321-1_38
The Fibonacci automorphism of free Burnside groups
Ashot S. PahlevanyanRAIRO - Theoretical Informatics and Applications 45 (3) 301 (2011)
https://doi.org/10.1051/ita/2011118
The Critical Exponent is Computable for Automatic Sequences
Jeffrey ShallitElectronic Proceedings in Theoretical Computer Science 63 231 (2011)
https://doi.org/10.4204/EPTCS.63.29
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
Infinite words containing squares at every position
James Currie and Narad RampersadRAIRO - Theoretical Informatics and Applications 44 (1) 113 (2010)
https://doi.org/10.1051/ita/2010007
Repetitions in Beta-Integers
L’ubomíra Balková, Karel Klouda and Edita PelantováLetters in Mathematical Physics 87 (1-2) 181 (2009)
https://doi.org/10.1007/s11005-009-0301-z
ON THE REPETITIVITY INDEX OF INFINITE WORDS
ARTURO CARPI and VALERIO D'ALONZOInternational Journal of Algebra and Computation 19 (02) 145 (2009)
https://doi.org/10.1142/S0218196709004968
Repetitions in strings: Algorithms and combinatorics
Maxime Crochemore, Lucian Ilie and Wojciech RytterTheoretical Computer Science 410 (50) 5227 (2009)
https://doi.org/10.1016/j.tcs.2009.08.024
Relation between powers of factors and the recurrence function characterizing Sturmian words
Z. Masáková and E. PelantováTheoretical Computer Science 410 (38-40) 3589 (2009)
https://doi.org/10.1016/j.tcs.2009.04.003
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
On Critical exponents in fixed points ofk-uniform binary morphisms
Dalia KriegerRAIRO - Theoretical Informatics and Applications 43 (1) 41 (2009)
https://doi.org/10.1051/ita:2007042
Dejean's conjecture holds for N ≥ 27
James Currie and Narad RampersadRAIRO - Theoretical Informatics and Applications 43 (4) 775 (2009)
https://doi.org/10.1051/ita/2009017
Episturmian words: a survey
Amy Glen and Jacques JustinRAIRO - Theoretical Informatics and Applications 43 (3) 403 (2009)
https://doi.org/10.1051/ita/2009003
Dejean’s conjecture holds for n≥30
James Currie and Narad RampersadTheoretical Computer Science 410 (30-32) 2885 (2009)
https://doi.org/10.1016/j.tcs.2009.01.026
On extremal properties of the Fibonacci word
Julien CassaigneRAIRO - Theoretical Informatics and Applications 42 (4) 701 (2008)
https://doi.org/10.1051/ita:2008003
A hierarchy for circular codes
Giuseppe PirilloRAIRO - Theoretical Informatics and Applications 42 (4) 717 (2008)
https://doi.org/10.1051/ita:2008002
Reversals and palindromes in continued fractions
Boris Adamczewski and Jean-Paul AlloucheTheoretical Computer Science 380 (3) 220 (2007)
https://doi.org/10.1016/j.tcs.2007.03.017
On critical exponents in fixed points of non-erasing morphisms
Dalia KriegerTheoretical Computer Science 376 (1-2) 70 (2007)
https://doi.org/10.1016/j.tcs.2007.01.020
Every real number greater than 1 is a critical exponent
Dalia Krieger and Jeffrey ShallitTheoretical Computer Science 381 (1-3) 177 (2007)
https://doi.org/10.1016/j.tcs.2007.04.037
The structure of subword graphs and suffix trees of Fibonacci words
Wojciech RytterTheoretical Computer Science 363 (2) 211 (2006)
https://doi.org/10.1016/j.tcs.2006.07.025
STACS 2006
Dalia KriegerLecture Notes in Computer Science, STACS 2006 3884 104 (2006)
https://doi.org/10.1007/11672142_7
Mathematical Foundations of Computer Science 2006
Arturo CarpiLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2006 4162 226 (2006)
https://doi.org/10.1007/11821069_20
On Sturmian and episturmian words, and related topics
Amy GlenBulletin of the Australian Mathematical Society 74 (1) 155 (2006)
https://doi.org/10.1017/S0004972700047559
Developments in Language Theory
Dalia KriegerLecture Notes in Computer Science, Developments in Language Theory 4036 280 (2006)
https://doi.org/10.1007/11779148_26
Implementation and Application of Automata
Wojciech RytterLecture Notes in Computer Science, Implementation and Application of Automata 3845 250 (2006)
https://doi.org/10.1007/11605157_21
Inequalities characterizing standard Sturmian and episturmian words
Giuseppe PirilloTheoretical Computer Science 341 (1-3) 276 (2005)
https://doi.org/10.1016/j.tcs.2005.04.008
On powers of words occurring in binary codings of rotations
Boris AdamczewskiAdvances in Applied Mathematics 34 (1) 1 (2005)
https://doi.org/10.1016/j.aam.2004.02.001
The non-parametrizability of the word equation xyz=zvx: A short proof
Elena CzeizlerTheoretical Computer Science 345 (2-3) 296 (2005)
https://doi.org/10.1016/j.tcs.2005.07.012
Unsolved Problems in Number Theory
Richard K. GuyProblem Books in Mathematics, Unsolved Problems in Number Theory 1 311 (2004)
https://doi.org/10.1007/978-0-387-26677-0_6
Mathematical Foundations of Computer Science 2004
Elena PetreLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2004 3153 807 (2004)
https://doi.org/10.1007/978-3-540-28629-5_63
Some properties of the factors of Sturmian sequences
Wei-Ting Cao and Zhi-Ying WenTheoretical Computer Science 304 (1-3) 365 (2003)
https://doi.org/10.1016/S0304-3975(03)00213-5
Powers in Sturmian sequences
David Damanik and Daniel LenzEuropean Journal of Combinatorics 24 (4) 377 (2003)
https://doi.org/10.1016/S0195-6698(03)00026-X
Discrete Geometry for Computer Imagery
Valentin E. Brimkov and Reneta P. BarnevaLecture Notes in Computer Science, Discrete Geometry for Computer Imagery 2886 72 (2003)
https://doi.org/10.1007/978-3-540-39966-7_6
Developments in Language Theory
Antonio Restivo and Sergio SalemiLecture Notes in Computer Science, Developments in Language Theory 2295 117 (2002)
https://doi.org/10.1007/3-540-46011-X_9
Episturmian words and episturmian morphisms
Jacques Justin and Giuseppe PirilloTheoretical Computer Science 276 (1-2) 281 (2002)
https://doi.org/10.1016/S0304-3975(01)00207-9
Formal and Natural Computing
Antonio Restivo and Sergio SalemiLecture Notes in Computer Science, Formal and Natural Computing 2300 107 (2002)
https://doi.org/10.1007/3-540-45711-9_8
Locally Periodic Versus Globally Periodic Infinite Words
J. Karhumäki, A. Lepistö and W. PlandowskiJournal of Combinatorial Theory, Series A 100 (2) 250 (2002)
https://doi.org/10.1006/jcta.2002.3292
The Index of Sturmian Sequences
David Damanik and Daniel LenzEuropean Journal of Combinatorics 23 (1) 23 (2002)
https://doi.org/10.1006/eujc.2000.0496
Fractional powers in Sturmian words
Jacques Justin and Giuseppe PirilloTheoretical Computer Science 255 (1-2) 363 (2001)
https://doi.org/10.1016/S0304-3975(99)90294-3
Sturmian words and words with a critical exponent
Drew VandethTheoretical Computer Science 242 (1-2) 283 (2000)
https://doi.org/10.1016/S0304-3975(98)00227-8
The exact number of squares in Fibonacci words
Aviezri S. Fraenkel and Jamie SimpsonTheoretical Computer Science 218 (1) 95 (1999)
https://doi.org/10.1016/S0304-3975(98)00252-7
Automata, Languages and Programming
A. LepistöLecture Notes in Computer Science, Automata, Languages and Programming 1644 534 (1999)
https://doi.org/10.1007/3-540-48523-6_50
Fundamentals of Computation Theory
Roman Kolpakov and Gregory KucherovLecture Notes in Computer Science, Fundamentals of Computation Theory 1684 374 (1999)
https://doi.org/10.1007/3-540-48321-7_31
Jewels are Forever
Jean BerstelJewels are Forever 287 (1999)
https://doi.org/10.1007/978-3-642-60207-8_25
On repetition-free binary words of minimal density
Roman Kolpakov, Gregory Kucherov and Yuri TarannikovTheoretical Computer Science 218 (1) 161 (1999)
https://doi.org/10.1016/S0304-3975(98)00257-6
Automata, Languages and Programming
Juhani Karhumäki, Arto Lepistö and Wojciech PlandowskiLecture Notes in Computer Science, Automata, Languages and Programming 1443 421 (1998)
https://doi.org/10.1007/BFb0055072
Periodicity and the golden ratio
Filippo Mignosi, Antonio Restivo and Sergio SalemiTheoretical Computer Science 204 (1-2) 153 (1998)
https://doi.org/10.1016/S0304-3975(98)00037-1
Handbook of Formal Languages
Christian Choffrut and Juhani KarhumäkiHandbook of Formal Languages 329 (1997)
https://doi.org/10.1007/978-3-642-59136-5_6
α-Words and factors of characteristic sequences
Wai-Fong ChuanDiscrete Mathematics 177 (1-3) 33 (1997)
https://doi.org/10.1016/S0012-365X(96)00355-X
Fibonacci numbers and words
Giuseppe PirilloDiscrete Mathematics 173 (1-3) 197 (1997)
https://doi.org/10.1016/S0012-365X(94)00236-C
Beyond Quasicrystals
Wen Zhi-YingBeyond Quasicrystals 433 (1995)
https://doi.org/10.1007/978-3-662-03130-8_14
Mathematical Foundations of Computer Science 1995
Filippo Mignosi, Antonio Restivo and Sergio SalemiLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1995 969 337 (1995)
https://doi.org/10.1007/3-540-60246-1_140
Beyond Quasicrystals
J.-P. Allouche and M. Mendès FranceBeyond Quasicrystals 293 (1995)
https://doi.org/10.1007/978-3-662-03130-8_11
Automata, Languages and Programming
Filippo Mignosi and Patrice SééboldLecture Notes in Computer Science, Automata, Languages and Programming 700 507 (1993)
https://doi.org/10.1007/3-540-56939-1_98