A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
A sequence of independent experiments is performed, each one producing a letter from a given alphabet. We study the number of overlapping appearances of a given pattern of letters and we prove that, under quite general conditions, the number of overlapping appearances of long patterns is approximately distributed according to a Polya-Aeppli distribution.
number of overlapping appearances of long patterns
scientific article; zbMATH DE number 4026443
scientific article