Strict bounds for pattern avoidance

DOI10.1007/978-3-642-38771-5_11zbMATH Open1381.68229OpenAlexW1730750981MaRDI QIDQ5300833FDOQ5300833

Authors: Brent Woodhouse, F. Blanchet-Sadri 

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

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

Recommendations

• Strict bounds for pattern avoidance
• Pattern avoidance in partial words over a ternary alphabet
• Abelian pattern avoidance in partial words
• Further applications of a power series method for pattern avoidance
• Avoidable patterns on two letters

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (8)

• Strict bounds for pattern avoidance
• Further applications of a power series method for pattern avoidance
• Computing depths of patterns
• Density dichotomy in random words
• Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
• Multiple pattern avoidance with respect to fixed points and excedances
• Exponential lower bounds for the number of words of uniform length avoiding a pattern
• New problems of pattern avoidance

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

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