Recommendations
Cites work
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2051154 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3296252 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- A generalization of Thue freeness for partial words
- A one-sided Zimin construction
- A powerful abelian square-free substitution over 4 letters
- Abelian square-free partial words
- Abelian squares are avoidable on 4 letters
- Algorithmic Combinatorics on Partial Words
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- BLOCKING SETS OF TERMS
- Characterization of the repetitive commutative semigroups
- Freeness of partial words
- Maximal abelian square-free words of short length.
- On the number of Abelian square-free words on four letters
- Overlap-freeness in infinite partial words
- Partial words and a theorem of Fine and Wilf
- Partially abelian squarefree words
- Second Preimage Attacks on Dithered Hash Functions
- Square-free partial words
- Strongly non-repetitive sequences and progression-free sets
- Unending chess, symbolic dynamics and a problem in semi-groups
Cited in
(20)- Abelian square-free partial words
- On a conjecture of Erdős
- Abelian repetitions in partial words
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
- Algorithmic combinatorics on partial words
- scientific article; zbMATH DE number 1809720 (Why is no real title available?)
- Avoiding large squares in partial words
- Abelian pattern avoidance in partial words
- Abelian pattern avoidance in partial words
- How far away must forced letters be so that squares are still avoidable?
- Dyck Words, Lattice Paths, and Abelian Borders
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Existence of words over three-letter alphabet not containing squares with replacement errors
- Efficient enumeration of non-equivalent squares in partial words with few holes
- Partially abelian squarefree words
- A powerful abelian square-free substitution over 4 letters
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Avoiding abelian powers cyclically
- Abelian-primitive partial words
- Avoiding abelian powers in partial words
This page was built for publication: Avoiding Abelian squares in partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645980)
