Pages that link to "Item:Q2257294"
From MaRDI portal
The following pages link to Avoiding 2-binomial squares and cubes (Q2257294):
Displaying 10 items.
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Relations on words (Q505060) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- GAPS IN THE THUE–MORSE WORD (Q5870872) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
