Pages that link to "Item:Q2164005"
From MaRDI portal
The following pages link to Binomial complexities and Parikh-collinear morphisms (Q2164005):
Displaying 5 items.
- The abelian complexity of infinite words and the Frobenius problem (Q4987432) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)