The complexity of smooth words on 2-letter alphabets

DOI10.1016/J.TCS.2011.07.002zbMath1243.11018arXiv0904.0562OpenAlexW2007172366MaRDI QIDQ653325

Yun Bao Huang

Publication date: 9 January 2012

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

Full work available at URL: https://arxiv.org/abs/0904.0562

zbMATH Keywords

complexitydifferentiableKolakoski sequencesmooth word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Special sequences and polynomials (11B83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the complexity of \(C^{\infty }\)-words
• Combinatorial properties of smooth infinite words
• 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
• A note on differentiable palindromes.
• Smooth words on 2-letter alphabets having same parity
• About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
• Smooth words over arbitrary alphabets
• More Kolakoski Sequences
• Kolakoski-(3, 1) Is a (Deformed) Model Set
• Kolakoski-(2m,2n) are limit-periodic model sets

This page was built for publication: The complexity of smooth words on 2-letter alphabets