Long binary patterns are abelian 2-avoidable

DOI10.1016/j.tcs.2008.08.039zbMath1171.68034OpenAlexW2053695139MaRDI QIDQ2378523

Terry I. Visentin, James D. Currie

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.039

zbMATH Keywords

pattern avoidancecombinatorics on wordsnon-repetitive sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Fast algorithms for abelian periods in words and greatest common divisor queries, The undirected repetition threshold and undirected pattern avoidance, Abelian combinatorics on words: a survey, Avoiding or Limiting Regularities in Words, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On abelian 2-avoidable binary patterns
• Avoidable patterns in strings of symbols
• Strongly non-repetitive sequences and progression-free sets
• Every binary pattern of length six is avoidable on the two-letter alphabet
• Avoiding Patterns in the Abelian Sense
• BLOCKING SETS OF TERMS
• Abelian squares are avoidable on 4 letters