Growth problems for avoidable words
Theoretical Computer Science
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
The number of binary words avoiding abelian fourth powers grows exponentially
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Pattern avoidance: themes and variations
Theoretical Computer Science - Combinatorics on words
A powerful abelian square-free substitution over 4 letters
Theoretical Computer Science
Avoiding abelian powers in partial words
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Fixed points avoiding Abelian k-powers
Journal of Combinatorial Theory Series A
A note on efficient computation of all Abelian periods in a string
Information Processing Letters
Hi-index | 5.23 |
We exhibit a cyclic binary morphism avoiding Abelian fourth powers.