The set of \(k\)-power free words over \(\Sigma\) is empty or perfect

DOI10.1016/S0195-6698(03)00044-1zbMath1023.68071MaRDI QIDQ1399694

Robert O. Shelton, James D. Currie

Publication date: 30 July 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\(\omega\)-words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

On the Tree of Ternary Square-Free Words ⋮ Transition property for cube-free words

Cites Work

• Unnamed Item
• Unnamed Item
• Growth problems for avoidable words
• On the structure and extendibility of \(k\)-power free words
• Sur un théorème de Thue
• A periodicity theorem on words and applications
• Binary Sequences which Contain no BBb
• Open Problems in Pattern Avoidance