Strict bounds for pattern avoidance

DOI10.1016/j.tcs.2013.08.010zbMath1301.68209OpenAlexW2065093446MaRDI QIDQ393106

Brent Woodhouse, Francine Blanchet-Sadri

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Strict_2013.pdf

zbMATH Keywords

power seriesformal languagespattern avoidancecombinatorics on wordspartial words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (8)

Doubled patterns are 3-avoidable ⋮ A short proof that shuffle squares are 7-avoidable ⋮ A General Framework for Hypergraph Coloring ⋮ Computing Depths of Patterns ⋮ Application of entropy compression in pattern avoidance ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ Pattern avoidance in partial words over a ternary alphabet

Uses Software

• NAIVE
• DAVID_IAN
• JODO
• BLANKS
• SYMGJ
• SPGJ
• GJseries
• GJSAW
• GJsqfree

Cites Work

• Unnamed Item
• Unnamed Item
• Further applications of a power series method for pattern avoidance
• Avoidable binary patterns in partial words
• Every binary pattern of length six is avoidable on the two-letter alphabet
• Exponential lower bounds for the number of words of uniform length avoiding a pattern
• Computing the Partial Word Avoidability Indices of Ternary Patterns
• A generator of morphisms for infinite words
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Strict Bounds for Pattern Avoidance

This page was built for publication: Strict bounds for pattern avoidance