![]() |
Discrete Mathematics & Theoretical Computer Science |
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.
Source : ScholeXplorer
IsRelatedTo ARXIV math/9808080 Source : ScholeXplorer IsRelatedTo DOI 10.1006/aama.1996.0016 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/9808080
|