On the number of C∞-words of each length

Authors:
W. D. Weakley
Affiliations:
-
Venue:
Journal of Combinatorial Theory Series A
Year:
1989

Citing 0
Cited 6

A note on differentiable palindromes

Theoretical Computer Science
Combinatorial properties of smooth infinite words

Theoretical Computer Science
Smooth words on 2-letter alphabets having same parity

Theoretical Computer Science
A note on the complexity of C∞-words

Theoretical Computer Science
The complexity of smooth words on 2-letter alphabets

Theoretical Computer Science
Automata and differentiable words

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract