Skip to Main content Skip to Navigation
New interface
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [97 references]  Display  Hide  Download
Contributor : Franck Thollard Connect in order to contact the contributor
Submitted on : Thursday, October 16, 2008 - 6:08:48 PM
Last modification on : Saturday, June 25, 2022 - 10:49:56 AM
Long-term archiving on: : Thursday, June 3, 2010 - 10:12:45 PM


Publisher files allowed on an open archive


  • 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⟩



Record views


Files downloads