Avoidable binary patterns in partial words

DOI10.1007/S00236-010-0129-0MaRDI QIDQ766156zbMATH OpenOpenAlexFDO

Authors Robert Mercaş, Sean Simmons, Eric Weissenstein, F. 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)

Recommendations

• Avoidable binary patterns in partial words
• Pattern avoidance in partial words dense with holes
• Computing the partial word avoidability indices of binary patterns
• Unary Pattern Avoidance in Partial Words Dense with Holes
• Computing depths of patterns

Cites work

• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A generalization of Thue freeness for partial words
• Algorithmic Combinatorics on Partial Words
• Avoidable binary patterns in partial words
• Avoidable patterns in strings of symbols
• Avoidable patterns on two letters
• BLOCKING SETS OF TERMS
• Every binary pattern of length six is avoidable on the two-letter alphabet
• Freeness of partial words
• Overlap-freeness in infinite partial words
• Unavoidable binary patterns

Cited in

(23)

• Binary patterns in binary cube-free words: avoidability and growth
• Every binary pattern of length six is avoidable on the two-letter alphabet
• On Long Words Avoiding Zimin Patterns
• Algorithmic combinatorics on partial words
• Strict bounds for pattern avoidance
• Computing the partial word avoidability indices of ternary patterns
• Avoidable binary patterns in partial words
• Pattern avoidance in partial words over a ternary alphabet
• Partial matchings and pattern avoidance
• Computing the partial word avoidability indices of binary patterns
• Computing the partial word avoidability indices of ternary patterns
• Pattern avoidance in partial words dense with holes
• Characterization of some binary words with few squares
• Unary Pattern Avoidance in Partial Words Dense with Holes
• Classifying all avoidable sets of partial words of size two
• Open problems on avoidable patterns in partial words
• Computing depths of patterns
• BINARY PATTERNS IN BINARY WORDS
• Number of holes in unavoidable sets of partial words. I.
• Avoiding cross-bifix-free binary words
• On the aperiodic avoidability of binary patterns with variables and reversals
• scientific article; zbMATH DE number 2087216 (Why is no real title available?)
• Every binary pattern of length greater than 14 is abelian-2-avoidable

This page was built for publication: Avoidable binary patterns in partial words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766156)