The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
type: Item
instance of: scholarly article
title: The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
zbMATH Open document ID: 1191.68478
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5626960
zbMATH Keywords: Kolakoski sequence
zbMATH Keywords: derivative
zbMATH Keywords: \(C^\infty \)-words
zbMATH Keywords: \(\varDelta \)-operator
zbMATH Keywords: \(\nabla\)-operator
zbMATH Keywords: \(C^\omega \)-words
zbMATH Keywords: \(C^{b\omega}\)-words
zbMATH Keywords: palindrome
zbMATH Keywords: \(C^\infty \)-quasi-palindrome
author: Yunbao Huang
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.06.034
OpenAlex ID: W155854422
cites work: Palindrome complexity.
cites work: A note on palindromicity
cites work: A note on differentiable palindromes.
cites work: Palindrome complexity bounds for primitive substitution sequences
cites work: Palindromes in the Fibonacci word
cites work: Palindromes and Sturmian words
cites work: Q3409317
cites work: About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
DOI: 10.1016/J.TCS.2009.06.034
Recommended article: A note on the complexity of \(C^{\infty }\)-words
Recommended article: About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
Recommended article: On the number of \(C^{\infty}\)-words of each length
Recommended article: Q4366995
Recommended article: Q5492250
Recommended article: Q5384332
Recommended article: On a conjecture of powers of \(C^{\infty}\)-words
Recommended article: Q5184423
Recommended article: Q3814828
Recommended article: The abelian complexity of infinite words and the Frobenius problem
description: scientific article; zbMATH DE number 5626960