Pages that link to "Item:Q496047"
From MaRDI portal
The following pages link to On some generalizations of abelian power avoidability (Q496047):
Displaying 20 items.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- On \(k\)-abelian avoidability (Q376138) (← links)
- Relations on words (Q505060) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- On shortest crucial words avoiding abelian powers (Q968182) (← links)
- A compactness property of the \(k\)-abelian monoids (Q2192368) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Binary patterns in binary cube-free words: Avoidability and growth (Q2934274) (← links)
- 5-Abelian cubes are avoidable on binary alphabets (Q2934279) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- (Q3362863) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ (Q4685343) (← links)
- Avoidability of Additive Cubes over Alphabets of Four Numbers (Q5041260) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
