On repeated factors in \(C^\infty\)-words
From MaRDI portal
Publication:1342256
DOI10.1016/0020-0190(94)00162-6zbMath0938.68698MaRDI QIDQ1342256
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
68R15: Combinatorics on words
Related Items
On \(k\)-abelian avoidability, Automata and differentiable words, Vertical representation of \(\mathbf{C}^\infty\)-words, The complexity of smooth words on 2-letter alphabets, A note on the complexity of \(C^{\infty }\)-words, Problems in between words and abelian words: \(k\)-abelian avoidability, Combinatorial properties of smooth infinite words, Smooth words on 2-letter alphabets having same parity, Smooth words over arbitrary alphabets, ON THE REPETITIVITY INDEX OF INFINITE WORDS
Cites Work