Minimal critical exponent of quasiperiodic words
From MaRDI portal
Publication:401485
DOI10.1016/J.TCS.2014.06.039zbMATH Open1360.68660OpenAlexW2012680709MaRDI QIDQ401485FDOQ401485
Authors: Gwénaël Richomme 
Publication date: 27 August 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.039
Recommendations
- Critical exponents of infinite balanced words
- Quasiperiods of infinite words
- Quasiperiods of biinfinite words
- On the critical exponent of generalized Thue-Morse words
- The Maximal Subword Complexity of Quasiperiodic Infinite Words
- Determining sets of quasiperiods of infinite words
- Quasiperiods, subword complexity and the smallest Pisot number
- Quasi-random words and limits of word sequences
- Quasi-random words and limits of word sequences
- Quasiperiodic Sturmian words and morphisms
Cites Work
- Title not available (Why is that?)
- Uniformly growing k-th power-free homomorphisms
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Efficient detection of quasiperiodicities in strings
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Normal forms of quasiperiodic strings
- Dejean's conjecture holds for \(n\geq 30\)
- Quasiperiodic and Lyndon episturmian words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- On Quasiperiodic Morphisms
- A proof of Dejean’s conjecture
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dejean's conjecture holds for N ≥ 27
- Last cases of Dejean's conjecture
- Polynomial versus exponential growth in repetition-free binary words
- Quasiperiodic Sturmian words and morphisms
- Dejean's conjecture and Sturmian words
- Every real number greater than 1 is a critical exponent
This page was built for publication: Minimal critical exponent of quasiperiodic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401485)
