The Root of a Language and Its Complexity
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Counting bordered and primitive words with a fixed weight
Theoretical Computer Science - The art of theory
Scattered subword complexity of non-primitive words
Journal of Automata, Languages and Combinatorics
Primitive words are unavoidable for context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 5.23 |