Dejean's conjecture and letter frequency
From MaRDI portal
Publication:5899396
DOI10.1016/J.ENDM.2007.01.068zbMATH Open1291.68300OpenAlexW2077961902WikidataQ123166258 ScholiaQ123166258MaRDI QIDQ5899396FDOQ5899396
Authors: J. 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/
Recommendations
- Dejean's conjecture and letter frequency
- On Dejean's conjecture over large alphabets
- On the Frequency of Letters in Morphic Sequences
- Dejean's conjecture and Sturmian words
- Developments in Language Theory
- The destruction of frequencies of letters through regular combinatorial structures
- Abelian complexity and frequencies of letters in infinite words
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On the asymptotic normality of the frequencies of letters in a multicyclic sequence
- Letter frequency in infinite repetition-free words
Cites Work
- Title not available (Why is that?)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- Sur un théorème de Thue
- Dejean's conjecture and Sturmian words
- 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
- Title not available (Why is that?)
- On the Repetition Threshold for Large Alphabets
Cited In (3)
This page was built for publication: Dejean's conjecture and letter frequency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899396)
