Pages that link to "Item:Q2849991"
From MaRDI portal
The following pages link to Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words (Q2849991):
Displaying 5 items.
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
