On unavoidable sets of word patterns

Alexander Burstein, Sergey Kitaev

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets o…