The repetition threshold for binary rich words
From MaRDI portal
Publication:5130737
DOI10.23638/DMTCS-22-1-6zbMath1456.68135arXiv1908.03169MaRDI QIDQ5130737
Narad Rampersad, James D. Currie, L. A. S. Mól
Publication date: 28 October 2020
Full work available at URL: https://arxiv.org/abs/1908.03169
Related Items (7)
On Morphisms Preserving Palindromic Richness ⋮ On minimal critical exponent of balanced sequences ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ Ostrowski-automatic sequences: theory and applications ⋮ On balanced sequences and their asymptotic critical exponent ⋮ Abelian repetition threshold revisited ⋮ On balanced sequences and their critical exponent
Cites Work
- Unnamed Item
- Unnamed Item
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- Extensions of rich words
- Last cases of Dejean's conjecture
- Polynomial versus exponential growth in repetition-free binary words
- Palindromic complexity of codings of rotations
- Infinite words with finite defect
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Rich, Sturmian, and trapezoidal words
- Palindromic richness
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sequences with subword complexity \(2n\)
- The index of Sturmian sequences
- Singular continuous spectrum for palindromic Schrödinger operators
- Burrows-Wheeler transform and palindromic richness
- Critical exponent of infinite balanced words via the Pell number system
- Repetitions in infinite palindrome-rich words
- Characterization of repetitions in Sturmian words: a new proof
- Critical exponents of infinite balanced words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- A proof of Dejean’s conjecture
- Dejean's conjecture holds for N ≥ 27
- Automatic Sequences
- Episturmian words: a survey
- Fractional powers in Sturmian words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: The repetition threshold for binary rich words
