Every real number greater than 1 is a critical exponent
From MaRDI portal
Publication:995572
DOI10.1016/j.tcs.2007.04.037zbMath1188.68216OpenAlexW2007361403MaRDI QIDQ995572
Dalia Krieger, Jeffrey O. Shallit
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.037
Related Items
The critical exponent functions ⋮ Squares and cubes in Sturmian sequences ⋮ On critical exponents in fixed points of non-erasing morphisms ⋮ On minimal critical exponent of balanced sequences ⋮ Minimal critical exponent of quasiperiodic words ⋮ Abelian combinatorics on words: a survey ⋮ Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ On $k$-abelian equivalence and generalized Lagrange spectra ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ Unnamed Item ⋮ The Critical Exponent is Computable for Automatic Sequences ⋮ Binary words with a given Diophantine exponent ⋮ Everywhere \(\alpha \)-repetitive sequences and Sturmian words ⋮ Asymptotic repetitive threshold of balanced sequences
Cites Work
- Pattern avoidance: themes and variations
- The equation \(a_ M=b^ Nc^ P\) in a free group
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Binary words containing infinitely many overlaps
- On critical exponents in fixed points of non-erasing morphisms
- Multidimensional unrepetitive configurations
- Sturmian words and words with a critical exponent
- Uniformly growing k-th power-free homomorphisms
- Sur un théorème de Thue
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Repetitions in the Fibonacci infinite word
- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
- On the Repetition Threshold for Large Alphabets
