Probabilistic finite-state machines - Part II. - Université Jean-Monnet-Saint-Étienne Access content directly
Journal Articles IEEE Transactions on Pattern Analysis and Machine Intelligence Year : 2005

Probabilistic finite-state machines - Part II.


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.
Fichier principal
Vignette du fichier
vidal_PFAII.pami05.pdf (274.64 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

ujm-00326250 , version 1 (16-10-2008)


  • HAL Id : ujm-00326250 , version 1


Enrique Vidal, Franck Thollard, Colin de La Higuera, Francisco Casacuberta, Rafael C. Carrasco. Probabilistic finite-state machines - Part II.. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27 (7), pp.1026-1039. ⟨ujm-00326250⟩
89 View
779 Download


Gmail Mastodon Facebook X LinkedIn More