Dejean's conjecture and letter frequency

DOI10.1016/j.endm.2007.01.068zbMath1291.68300OpenAlexW2077961902WikidataQ123166258 ScholiaQ123166258MaRDI QIDQ5899396

Jérémie Chalopin, Pascal Ochem

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2008__42_3_477_0/

zbMATH Keywords

combinatorics on wordsletter frequencyrepetition threshold

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Letter frequency in infinite repetition-free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ On the Sixth International Olympiad in Cryptography NSUCRYPTO

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Sur un théorème de Thue
• On the Repetition Threshold for Large Alphabets

This page was built for publication: Dejean's conjecture and letter frequency