On pattern frequency occurrences in a Markovian sequence

Consider a given pattern and a random text generated by a Markovian source of any order. We study the frequency of pattern occurrences in a random text when overlapping copies of the pattern are counted separately. More precisely: we consider two strings, a given pattern string H=h/sub 1/h/sub 2/....h/sub m/ and a random text string T=t/sub 1/t/sub 2/...t/sub n/ of respective lengths equal to m and n over an alphabet S of size V. The results for the Markovian model are summarized in two theorems.