Avoiding Abelian squares in partial words
From MaRDI portal
Publication:645980
DOI10.1016/J.JCTA.2011.08.008zbMATH Open1233.68183OpenAlexW1986142207MaRDI QIDQ645980FDOQ645980
Authors: Jane I. Kim, Robert Mercaş, William Severa, Sean Simmons, Dimin Xu, F. Blanchet-Sadri 
Publication date: 11 November 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2011.08.008
Recommendations
Cites Work
- BLOCKING SETS OF TERMS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Second Preimage Attacks on Dithered Hash Functions
- Square-free partial words
- Strongly non-repetitive sequences and progression-free sets
- Title not available (Why is that?)
- Abelian squares are avoidable on 4 letters
- Algorithmic Combinatorics on Partial Words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial words and a theorem of Fine and Wilf
- Title not available (Why is that?)
- A generalization of Thue freeness for partial words
- Overlap-freeness in infinite partial words
- Freeness of partial words
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
- Unending chess, symbolic dynamics and a problem in semi-groups
- On the number of Abelian square-free words on four letters
- Characterization of the repetitive commutative semigroups
- Maximal abelian square-free words of short length.
- Abelian square-free partial words
- Partially abelian squarefree words
- A one-sided Zimin construction
- A powerful abelian square-free substitution over 4 letters
Cited In (20)
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
- Abelian repetitions in partial words
- Algorithmic combinatorics on partial words
- Title not available (Why is that?)
- 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
- Avoiding abelian powers in partial words
- Abelian-primitive partial words
- Abelian square-free partial words
- On a conjecture of Erdős
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)
