Dejean's conjecture and letter frequency
From MaRDI portal
Publication:5900364
DOI10.1051/ita:2008013zbMath1147.68612OpenAlexW2004854557WikidataQ123219850 ScholiaQ123219850MaRDI QIDQ5900364
Pascal Ochem, Jérémie Chalopin
Publication date: 25 September 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92883
Related Items
Repetition thresholds for subdivided graphs and trees ⋮ Avoiding or Limiting Regularities in Words ⋮ Last cases of Dejean's conjecture
Cites Work
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On repetition-free binary words of minimal density
- On the entropy and letter frequencies of ternary square-free words
- Letter frequency in infinite repetition-free words
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- Unnamed Item
- Unnamed Item