On repeated factors in \(C^\infty\)-words

DOI10.1016/0020-0190(94)00162-6zbMath0938.68698OpenAlexW1968339888MaRDI QIDQ1342256

Arturo Carpi

Publication date: 21 June 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00162-6

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Combinatorial properties of smooth infinite words ⋮ On \(k\)-abelian avoidability ⋮ Automata and differentiable words ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ Smooth words on 2-letter alphabets having same parity ⋮ A note on the complexity of \(C^{\infty }\)-words ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ ON THE REPETITIVITY INDEX OF INFINITE WORDS ⋮ Smooth words over arbitrary alphabets

Cites Work

• 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
• Properties of infinite words : Recent results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On repeated factors in \(C^\infty\)-words