Every binary pattern of length six is avoidable on the two-letter alphabet

DOI10.1007/BF01178567zbMath0741.68083OpenAlexW1972107895MaRDI QIDQ1186515

Peter Roth

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1007/bf01178567

zbMATH Keywords

avoidable pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (16)

On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Long binary patterns are abelian 2-avoidable ⋮ Non-repetitive words: Ages and essences ⋮ On abelian 2-avoidable binary patterns ⋮ Binary words avoided by the Thue-Morse sequence ⋮ Strict bounds for pattern avoidance ⋮ Application of entropy compression in pattern avoidance ⋮ Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols ⋮ Patterns in words and languages ⋮ Grasshopper avoidance of patterns ⋮ Unavoidable sets of partial words ⋮ THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE ⋮ Avoidable binary patterns in partial words ⋮ On repetition-free binary words of minimal density ⋮ Avoidability index for binary patterns with reversal ⋮ Unavoidable binary patterns

Cites Work

• Growth problems for avoidable words
• Long unavoidable patterns
• Avoidable patterns on two letters
• Avoidable patterns in strings of symbols
• On nonrepetitive sequences
• BLOCKING SETS OF TERMS
• Unnamed Item
• Unnamed Item

This page was built for publication: Every binary pattern of length six is avoidable on the two-letter alphabet