The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)

DOI10.1016/J.TCS.2009.06.034zbMath1191.68478OpenAlexW155854422MaRDI QIDQ1034610

Yun Bao Huang

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

zbMATH Keywords

derivativepalindromeKolakoski sequence\(\nabla\)-operator\(\varDelta \)-operator\(C^{b\omega}\)-words\(C^\infty \)-quasi-palindrome\(C^\infty \)-words\(C^\omega \)-words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

The complexity of smooth words on 2-letter alphabets ⋮ A note on the complexity of \(C^{\infty }\)-words

Cites Work

• Unnamed Item
• Palindromes in the Fibonacci word
• A note on differentiable palindromes.
• Palindrome complexity bounds for primitive substitution sequences
• Palindrome complexity.
• Palindromes and Sturmian words
• A note on palindromicity
• About the number of \(C^\infty \)-words of form \(\widetilde wxw \)

This page was built for publication: The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)