On abelian 2-avoidable binary patterns

DOI10.1007/s00236-006-0030-zzbMath1111.68094OpenAlexW1982010621MaRDI QIDQ877171

Terry I. Visentin, James D. Currie

Publication date: 19 April 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0030-z

zbMATH Keywords

Fibonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Long binary patterns are abelian 2-avoidable ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ Everywhere \(\alpha \)-repetitive sequences and Sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infinite square-free co-CFL
• Arithmetic progressions in partially ordered sets
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• 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
• Intervals in the lattice of varieties
• On Abelian squares and substitutions
• On uniformly repetitive semigroups
• Characterization of the repetitive commutative semigroups
• Avoiding Patterns in the Abelian Sense
• BLOCKING SETS OF TERMS

This page was built for publication: On abelian 2-avoidable binary patterns