On some generalizations of the Thue--Morse morphism
Theoretical Computer Science
About some overlap-free morphisms on a n-letter alphabet
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the context-freeness of the set of words containing overlaps
Information Processing Letters
On the subword complexity of Thue–Morse polynomial extractions
Theoretical Computer Science
On the structure of compacted subword graphs of Thue-Morse words and their applications
Journal of Discrete Algorithms
| Hi-index | 0.89 |