output
20032005
most citedEnumerating Segmented Patterns in Compositions and Encoding by Restricted Permutations

5 citations

researchers with a paper here
collaborating institutions
Showing 2003 · math.COShow all

1 paper · 2 filters

math.CO2003

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…