Discrete Mathematics & Theoretical Computer Science, Vol 6, No 1 (2003)

Font Size:  Small  Medium  Large

Counting occurrences of some subword patterns

Alexander Burstein, Toufik Mansour

Abstract


We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page