A note on the complexity of \(C^{\infty }\)-words
type: Item
instance of: scholarly article
title: A note on the complexity of \(C^{\infty }\)-words
zbMATH Open document ID: 1208.68136
author: Yunbao Huang
author: William D. Weakley
published in: Theoretical Computer Science
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5798143
zbMATH Keywords: Kolakoski sequence
zbMATH Keywords: \(C^{\infty}\)-word
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.024
OpenAlex ID: W2042234960
cites work: A note on differentiable palindromes.
cites work: Q4431344
cites work: On repeated factors in \(C^\infty\)-words
cites work: Q3879325
cites work: Q3926698
cites work: Q4356052
cites work: About the number of \(C^\infty \)-words of form \(\widetilde wxw \)
cites work: The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\)
cites work: Q4010468
cites work: Q4431371
cites work: Some properties of \(C^ \infty\)-words with applications
cites work: Q4896930
cites work: On the number of \(C^{\infty}\)-words of each length
DOI: 10.1016/J.TCS.2010.06.024
description: scientific article; zbMATH DE number 5798143