On the context-freeness of the set of words containing overlaps
Information Processing Letters
Exponential lower bounds for the number of words of uniform length avoiding a pattern
Information and Computation
A powerful abelian square-free substitution over 4 letters
Theoretical Computer Science
| Hi-index | 0.00 |