![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
2. Markov chains and probabilistic finite-state automata
A Markov chain is a probabilistic finite-state automaton. It is used to model the dynamics of a process that can be in a finite number of possible states. We will denote S = {e 1 ,..., e N } the set of N possible states of a Markov chain and s t the random variable representing the state at time t of a Markov process (with ∀t, s t ∊ S).
By Markovian hypothesis we mean the assumption that the state of the process at a given point in time depends only on the state of the process at p previous points in time. In this case, we say that the Markov chain is a chain of order p. The vast majority of work based on Markovian models in pattern recognition exploits Markov chains of order 1, and...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Markov chains and probabilistic finite-state automata
Bibliography
Website
Wikipedia list of tools developed for speech recognition : http://en.wikipedia.org/wiki/List-of-speech-recognition-software
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference