Words Restricted by Patterns with at Most 2 Distinct Letters

Alexander Burstein, Toufik Mansour

Abstract


We find generating functions for the number of words avoiding certain patterns or sets of patterns with at most 2 distinct letters and determine which of them are equally avoided. We also find exact numbers of words avoiding certain patterns and provide bijective proofs for the resulting formulae.


Full Text: PDF