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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [97 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-00326250
Contributor : Franck Thollard <>
Submitted on : Thursday, October 16, 2008 - 6:08:48 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:30 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

Identifiers

  • HAL Id : ujm-00326250, version 1

Collections

Citation

Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, Rafael Carrasco. Probabilistic finite-state machines - Part II.. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2005, 27 (7), pp.1026-1039. ⟨ujm-00326250⟩

Share

Metrics

Record views

177

Files downloads

716