Repetitions in the Fibonacci infinite word
From MaRDI portal
Publication:4012668
DOI10.1051/ita/1992260301991zbMath0761.68078OpenAlexW1547342744MaRDI QIDQ4012668
Filippo Mignosi, Giuseppe Pirillo
Publication date: 27 September 1992
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92414
Related Items (59)
Abelian-square-rich words ⋮ Powers in Sturmian sequences ⋮ Abelian powers and repetitions in Sturmian words ⋮ A proof of Dejean’s conjecture ⋮ Relation between powers of factors and the recurrence function characterizing Sturmian words ⋮ Words with the Maximum Number of Abelian Squares ⋮ Reversals and palindromes in continued fractions ⋮ The index of Sturmian sequences ⋮ Avoiding letter patterns in ternary square-free words ⋮ Abelian Repetitions in Sturmian Words ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ The structure of subword graphs and suffix trees of Fibonacci words ⋮ Fibonacci numbers and words ⋮ Lie complexity of words ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ Episturmian words: a survey ⋮ \(\alpha\)-words and factors of characteristic sequences ⋮ On the Complexity of the Generalized Fibonacci Words ⋮ On critical exponents in fixed points of non-erasing morphisms ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Properties of a ternary infinite word ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Critical exponents of infinite balanced words ⋮ Prefixes of the Fibonacci word that end with a cube ⋮ Abelian combinatorics on words: a survey ⋮ Some properties of the factors of Sturmian sequences. ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ A generalization of the Fibonacci word fractal and the Fibonacci snowflake ⋮ Automatic complexity of Fibonacci and tribonacci words ⋮ On extremal properties of the Fibonacci word ⋮ A hierarchy for circular codes ⋮ If a DOL language is k-power free then it is circular ⋮ On Critical exponents in fixed points ofk-uniform binary morphisms ⋮ On $k$-abelian equivalence and generalized Lagrange spectra ⋮ Unnamed Item ⋮ The maximal number of cubic runs in a word ⋮ Periodic words connected with the Fibonacci words ⋮ On the fixed points of the iterated pseudopalindromic closure operator ⋮ Fractional powers in Sturmian words ⋮ On powers of words occurring in binary codings of rotations ⋮ Dejean's conjecture holds for \(n\geq 30\) ⋮ Infinite words containing squares at every position ⋮ Every real number greater than 1 is a critical exponent ⋮ Searching for Zimin patterns ⋮ Repetitions in beta-integers ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ The Fibonacci automorphism of free Burnside groups ⋮ Periodicity and the golden ratio ⋮ Repetitions in strings: algorithms and combinatorics ⋮ Binary words with a given Diophantine exponent ⋮ Dejean's conjecture holds for N ≥ 27 ⋮ Sturmian words and words with a critical exponent ⋮ The exact number of squares in Fibonacci words ⋮ On repetition-free binary words of minimal density ⋮ Inequalities characterizing standard Sturmian and episturmian words ⋮ The non-parametrizability of the word equation \(xyz=zvx\): a short proof ⋮ Episturmian words and episturmian morphisms ⋮ Locally periodic versus globally periodic infinite words ⋮ Rich square-free words
Cites Work
This page was built for publication: Repetitions in the Fibonacci infinite word
