Pages that link to "Item:Q388738"
From MaRDI portal
The following pages link to On a generalization of abelian equivalence and complexity of infinite words (Q388738):
Displayed 14 items.
- \(k\)-abelian pattern matching (Q491150) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- On the 2-abelian complexity of the Thue-Morse word (Q501000) (← links)
- Relations on words (Q505060) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences (Q2256124) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
