Pages that link to "Item:Q968182"
From MaRDI portal
The following pages link to On shortest crucial words avoiding abelian powers (Q968182):
Displaying 5 items.
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Improved bounds on the length of maximal abelian square-free words (Q1883627) (← links)
- ABELIAN PRIMITIVE WORDS (Q4902891) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)