On the number of \(C^{\infty}\)-words of each length
From MaRDI portal
Publication:1121320
DOI10.1016/0097-3165(89)90076-9zbMath0674.10043OpenAlexW2055125125MaRDI QIDQ1121320
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(89)90076-9
Related Items (7)
Combinatorial properties of smooth infinite words ⋮ A note on differentiable palindromes. ⋮ Automata and differentiable words ⋮ The complexity of smooth words on 2-letter alphabets ⋮ Vertical representation of \(\mathbf{C}^\infty\)-words ⋮ Smooth words on 2-letter alphabets having same parity ⋮ A note on the complexity of \(C^{\infty }\)-words
Cites Work
This page was built for publication: On the number of \(C^{\infty}\)-words of each length
