On the number of word occurrences in a semi-Markov sequence of letters
Μαργαρίτα Καραλιοπούλου · ESAIM Probability and Statistics · 2008
Let a finite alphabet Ω. We consider a sequence of letters from Ω generated by a discrete time semi-Markov process We derive the probability of a word occurrence in the sequence. We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain conditions.