Avoiding Abelian squares in partial words

DOI10.1016/j.jcta.2011.08.008zbMath1233.68183OpenAlexW1986142207MaRDI QIDQ645980

William Severa, Robert Mercaş, Jane I. Kim, Sean Simmons, Dimin Xu, Francine 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

zbMATH Keywords

morphismscombinatorics on wordspartial wordsParikh vectorsAbelian squares

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Fast algorithms for abelian periods in words and greatest common divisor queries, Abelian-primitive partial words, Avoiding abelian powers cyclically, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A powerful abelian square-free substitution over 4 letters
• Square-free partial words
• A generalization of Thue freeness for partial words
• Overlap-freeness in infinite partial words
• Strongly non-repetitive sequences and progression-free sets
• Partial words and a theorem of Fine and Wilf
• On the number of Abelian square-free words on four letters
• Maximal abelian square-free words of short length.
• Freeness of partial words
• Characterization of the repetitive commutative semigroups
• Unending chess, symbolic dynamics and a problem in semi-groups
• Abelian Square-Free Partial Words
• An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
• BLOCKING SETS OF TERMS
• Abelian squares are avoidable on 4 letters
• Algorithmic Combinatorics on Partial Words
• Second Preimage Attacks on Dithered Hash Functions
• Partially abelian squarefree words
• A one-sided Zimin construction