Pages that link to "Item:Q2629230"
From MaRDI portal
The following pages link to Computing abelian complexity of binary uniform morphic words (Q2629230):
Displayed 7 items.
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- The Frobenius problem for homomorphic embeddings of languages into the integers (Q1637229) (← links)
- On the 2-abelian complexity of generalized Cantor sequences (Q2087468) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Minimal Complexities for Infinite Words Written with d Letters (Q6134858) (← links)