Combinatorial properties of smooth infinite words
Theoretical Computer Science
Smooth words over arbitrary alphabets
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
Problems in between words and abelian words: k-abelian avoidability
Theoretical Computer Science
| Hi-index | 0.90 |