About the number of \(C^\infty \)-words of form \(\widetilde wxw \)

DOI10.1016/J.TCS.2007.11.004zbMath1136.68046OpenAlexW2207697069MaRDI QIDQ2481971

Yanyan Li

Publication date: 15 April 2008

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

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

zbMATH Keywords

derivativepalindromeKolakoski sequence\(C^\infty \)-words\(C^\omega \)-words\(\Delta \)-operator\(C^{b\omega }\)-words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

The complexity of smooth words on 2-letter alphabets ⋮ A note on the complexity of \(C^{\infty }\)-words ⋮ The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)

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

This page was built for publication: About the number of \(C^\infty \)-words of form \(\widetilde wxw \)