Approaching repetition thresholds via local resampling and entropy compression
From MaRDI portal
Publication:6088949
DOI10.1007/978-3-031-33264-7_18OpenAlexW4377081603MaRDI QIDQ6088949
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_18
Cites Work
- Unnamed Item
- Application of entropy compression in pattern avoidance
- Generating square-free words efficiently
- Last cases of Dejean's conjecture
- 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
- On Dejean's conjecture over large alphabets
- Sur un théorème de Thue
- The undirected repetition threshold and undirected pattern avoidance
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS
- A proof of Dejean’s conjecture
- A short proof that shuffle squares are 7-avoidable
- A constructive proof of the general lovász local lemma
- New approach to nonrepetitive sequences
- Avoiding squares over words with lists of size three amongst four symbols
- On the growth rates of complexity of threshold languages
- Abelian squares are avoidable on 4 letters
