Pages that link to "Item:Q714821"
From MaRDI portal
The following pages link to Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821):
Displaying 16 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)
- Binary avoidability and Thue-Morse words (Q1380288) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Existence of an infinite ternary 64-abelian square-free word (Q2874639) (← links)
- 5-Abelian cubes are avoidable on binary alphabets (Q2934279) (← links)
- Van der Waerden's Theorem and Avoidability in Words (Q3081580) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS (Q5495424) (← links)
- A completeness proof for a regular predicate logic with undefined truth value (Q6100982) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
