On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
Ourania Chryssaphinou, Μαργαρίτα Καραλιοπούλου, Nikolaos Limnios · Communication in Statistics- Theory and Methods · 2008
Let a discrete time semi-Markov process {Z γ;γ ∈ ℕ} with finite state space an alphabet Ω. Defining the process {U γ; γ ∈ ℕ} to be the backward recurrence time of the process {Z γ; γ ∈ ℕ}, we study the Markov process {(Z γ, U γ); γ ∈ ℕ}. We give its transition probabilities of first and higher order, the limiting distribution, and the stationary distribution. Using this Markov process we construct a k-dimensional process and we study its basic properties. As an application we consider a finite set of words W = {w 1, w 2,…, w ν} of equal length k which are produced under the semi-Markovian hypothesis and we focus on the waiting time for the first word occurrence from the set W. The corresponding probability distribution, the generating function, as well as the mean waiting time and variance are obtained.