Pages that link to "Item:Q714821"

The following pages link to Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821):

Displayed 9 items.

• Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) ‎ (← links)
• Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) ‎ (← links)
• On \(k\)-abelian avoidability (Q376138) ‎ (← links)
• On a generalization of abelian equivalence and complexity of infinite words (Q388738) ‎ (← links)
• \(k\)-abelian pattern matching (Q491150) ‎ (← links)
• On some generalizations of abelian power avoidability (Q496047) ‎ (← links)
• On growth and fluctuation of \(k\)-abelian complexity (Q2400973) ‎ (← links)
• On Growth and Fluctuation of k-Abelian Complexity (Q3194711) ‎ (← links)
• FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS (Q5495424) ‎ (← links)