ABSTRACT
Markov models, also known as aMarkov chains orMarkov processes, are a type of probabilistic model that is very useful in the analysis of strings or sequences, such as text or time series. In a Markov process, time is viewed discretely; time instants are numbered 0, 1, 2, . . . . The process has a finite1 number of states; at each instant, the process is in one particular state. Between time I and time I +1, the process executes a transition from one state to another, and its destination is probabilistically determined.
