Unavoidable binary patterns

DOI10.1007/BF01209712zbMATH Open0790.68096MaRDI QIDQ1323331FDOQ1323331

Julien Cassaigne

Publication date: 1993

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

Recommendations

• Every binary pattern of length greater than 14 is abelian-2-avoidable
• Avoidable binary patterns in partial words
• Every binary pattern of length six is avoidable on the two-letter alphabet
• scientific article; zbMATH DE number 4035171

zbMATH Keywords

avoidability by iterated morphismsunavoidable binary patterns

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Avoidable patterns in strings of symbols
• Every binary pattern of length six is avoidable on the two-letter alphabet
• BLOCKING SETS OF TERMS
• Growth problems for avoidable words
• Avoidable patterns on two letters
• Title not available (Why is that?)

Cited In (15)

• Title not available (Why is that?)
• Avoidability index for binary patterns with reversal
• Computing the partial word avoidability indices of ternary patterns
• Title not available (Why is that?)
• Avoidable binary patterns in partial words
• Finite degrees of ambiguity in pattern languages
• Patterns in words and languages
• Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
• Grasshopper avoidance of patterns
• On the aperiodic avoidability of binary patterns with variables and reversals
• Avoidable patterns on two letters
• Unavoidable sets of partial words
• On avoding \(r\)-repetitions in \(\mathbb R^2\)
• Binary words avoided by the Thue-Morse sequence
• A periodic division pattern that cannot be generated by D0L systems

This page was built for publication: Unavoidable binary patterns

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