Counting occurrences of some subword patterns - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2003

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.
Fichier principal
Vignette du fichier
dm060101.pdf (83.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958999 , version 1 (13-03-2014)

Identifiers

Cite

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⟩

Collections

CNRS TDS-MACS
102 View
1106 Download

Altmetric

Share

Gmail Facebook X LinkedIn More