ON PANSIOT WORDS AVOIDING 3-REPETITIONS
From MaRDI portal
Publication:2841970
DOI10.1142/S0129054112400631zbMath1269.68076MaRDI QIDQ2841970
Irina A. Gorbunova, Arseny M. Shur
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
combinatorial complexityDejean's conjecture2-dimensional wordscylindric wordsPansiot wordsthreshold languages
Related Items (1)
Cites Work
- Last cases of Dejean's conjecture
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Dejean's conjecture and Sturmian words
- Growth rates of complexity of power-free languages
- 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
- A proof of Dejean’s conjecture
- Comparing Complexity Functions of a Language and Its Extendable Part
- Dejean's conjecture holds for N ≥ 27
- On the growth rates of complexity of threshold languages
This page was built for publication: ON PANSIOT WORDS AVOIDING 3-REPETITIONS
