Pages that link to "Item:Q645980"
From MaRDI portal
The following pages link to Avoiding Abelian squares in partial words (Q645980):
Displaying 16 items.
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Existence of words over three-letter alphabet not containing squares with replacement errors (Q1791616) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- On a conjecture of Erdős (Q2770690) (← links)
- Abelian pattern avoidance in partial words (Q2874640) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns (Q4626557) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- How far away must forced letters be so that squares are still avoidable? (Q5118863) (← links)
- Partially abelian squarefree words (Q5751950) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146) (← links)
- Dyck Words, Lattice Paths, and Abelian Borders (Q6114866) (← links)