 |
Université Jean Monnet – Saint-Etienne |  |
Journal articles
Probabilistic finite-state machines - Part II.
Abstract : Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked. In part I of this paper, we surveyed these objects and studied their properties. In this part II, we study the relations between probabilistic finite-state automata and other well known devices that generate strings like hidden Markov models and - grams, and provide theorems, algorithms and properties that represent a current state of the art of these objects.
Cited literature [97 references]
https://hal-ujm.archives-ouvertes.fr/ujm-00326250
Contributor : Franck Thollard <>
Submitted on : Thursday, October 16, 2008 - 6:08:48 PM
Last modification on : Monday, January 13, 2020 - 5:46:02 PM
Long-term archiving on: : Thursday, June 3, 2010 - 10:12:45 PM
Contributor : Franck Thollard <>
Submitted on : Thursday, October 16, 2008 - 6:08:48 PM
Last modification on : Monday, January 13, 2020 - 5:46:02 PM
Long-term archiving on: : Thursday, June 3, 2010 - 10:12:45 PM
File
vidal_PFAII.pami05.pdf
Publisher files allowed on an open archive