Article contents
On the number of word occurrences in a semi-Markov sequence of letters
Published online by Cambridge University Press: 21 July 2009
Abstract
Let a finite alphabet Ω. We consider a sequence of letters from Ω
generated by a discrete time semi-Markov process $\{Z_{\gamma};\ \gamma\in \xN \}.$ 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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, SMAI, 2009
References
- 3
- Cited by