Burstein, Alexander; Mansour, Toufik Counting occurrences of some subword patterns. (English) Zbl 1025.68026 Discrete Math. Theor. Comput. Sci. 6, No. 1, 1-12 (2003). Summary: 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. Cited in 9 Documents MSC: 68P10 Searching and sorting 68Q45 Formal languages and automata Keywords:generalized patterns; subword patterns PDF BibTeX XML Cite \textit{A. Burstein} and \textit{T. Mansour}, Discrete Math. Theor. Comput. Sci. 6, No. 1, 1--12 (2003; Zbl 1025.68026) Full Text: arXiv EuDML EMIS OpenURL