Pages that link to "Item:Q3589628"
From MaRDI portal
The following pages link to Ultimately constant abelian complexity of infinite words (Q3589628):
Displaying 14 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← links)
- On balanced and abelian properties of circular words over a ternary alphabet (Q2098185) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- (Q5089254) (← links)
- Sturmian words and constant additive complexity (Q5262049) (← links)
- On additive complexity of infinite words (Q5404275) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- 2-balanced sequences coding rectangle exchange transformation (Q6661759) (← links)