Pages that link to "Item:Q5175078"
From MaRDI portal
The following pages link to Abelian maximal pattern complexity of words (Q5175078):
Displaying 10 items.
- Recurrent words with constant abelian complexity (Q544139) (← links)
- Maximal pattern complexity of higher dimensional words (Q965228) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- Maximal pattern complexity of two-dimensional words (Q2503281) (← links)
- Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- On Abelian and Additive Complexity in Infinite Words (Q4650104) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)