The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
From MaRDI portal
Publication:1034610
DOI10.1016/j.tcs.2009.06.034zbMath1191.68478MaRDI QIDQ1034610
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.034
derivative; palindrome; Kolakoski sequence; \(\nabla\)-operator; \(\varDelta \)-operator; \(C^{b\omega}\)-words; \(C^\infty \)-quasi-palindrome; \(C^\infty \)-words; \(C^\omega \)-words
68R15: Combinatorics on words
Related Items
The complexity of smooth words on 2-letter alphabets, A note on the complexity of \(C^{\infty }\)-words
Cites Work