Counting occurrences of some subword patterns

Alexander Burstein (1) , Toufik Mansour (2)

1 Department of Mathematics [IOWA]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Mots clés: Generalized patterns; subword patterns

Domaines: Mathématique discrète [cs.DM]

Alexander Burstein, Toufik Mansour. Counting occurrences of some subword patterns. Discrete Mathematics and Theoretical Computer Science, 2003, Vol. 6 no. 1 (1), pp.1-12. ⟨10.46298/dmtcs.320⟩. ⟨hal-00958999⟩