Skip to Main content Skip to Navigation
Journal articles

Counting occurrences of some subword patterns

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958999
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 5:03:17 PM
Last modification on : Saturday, June 25, 2022 - 10:34:31 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:10:25 PM

File

dm060101.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

101

Files downloads

1017