Pages that link to "Item:Q4987432"

The following pages link to The abelian complexity of infinite words and the Frobenius problem (Q4987432):

Displaying 8 items.

• Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
• The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) (Q1034610) (← links)
• The Frobenius problem for homomorphic embeddings of languages into the integers (Q1637229) (← links)
• The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
• Abelian complexity and abelian co-decomposition (Q1935803) (← links)
• On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
• Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
• Properties of infinite words : Recent results (Q5096141) (← links)