Avoidable binary patterns in partial words

DOI10.1007/s00236-010-0129-0zbMath1243.68230OpenAlexW2007782354MaRDI QIDQ766156

Robert Mercaş, Sean Simmons, Eric Weissenstein, Francine Blanchet-Sadri

Publication date: 23 March 2012

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

Full work available at URL: https://doi.org/10.1007/s00236-010-0129-0

zbMATH Keywords

combinatorics on wordsavoidability indexpartial wordsbinary patterns

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items

On the aperiodic avoidability of binary patterns with variables and reversals, Strict bounds for pattern avoidance, Computing the partial word avoidability indices of binary patterns, Computing the partial word avoidability indices of ternary patterns, Computing Depths of Patterns, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, Characterization of some binary words with few squares

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of Thue freeness for partial words
• Overlap-freeness in infinite partial words
• Avoidable patterns on two letters
• Avoidable patterns in strings of symbols
• Every binary pattern of length six is avoidable on the two-letter alphabet
• Unavoidable binary patterns
• Freeness of partial words
• Avoidable Binary Patterns in Partial Words
• BLOCKING SETS OF TERMS
• Algorithmic Combinatorics on Partial Words