A note on the complexity of \(C^{\infty }\)-words

DOI10.1016/J.TCS.2010.06.024zbMath1208.68136OpenAlexW2042234960MaRDI QIDQ708227

Yun Bao Huang, William D. Weakley

Publication date: 11 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.024

zbMATH Keywords

Kolakoski sequence\(C^{\infty}\)-word

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Related Items (1)

The complexity of smooth words on 2-letter alphabets

Cites Work

• The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
• On the number of \(C^{\infty}\)-words of each length
• On repeated factors in \(C^\infty\)-words
• Some properties of \(C^ \infty\)-words with applications
• A note on differentiable palindromes.
• About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the complexity of \(C^{\infty }\)-words