Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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 some questions regarding k -regular and k -context-free sequences
Theoretical Computer Science
On the joint subword complexity of automatic sequences
Theoretical Computer Science
| Hi-index | 5.24 |