HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Probabilistic finite-state machines - Part I.

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: computational linguistics, machine learning, time series analysis, circuit testing, computational biology, speech recognition and machine translation are some of them. In part I of this paper we survey these generative objects and study their definitions and properties. In part II, we will study the relation of probabilistic finite-state automata with other well known devices that generate strings as 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 [59 references]  Display  Hide  Download

Contributor : Franck Thollard Connect in order to contact the contributor
Submitted on : Thursday, October 16, 2008 - 6:09:11 PM
Last modification on : Monday, May 17, 2021 - 11:44:27 AM
Long-term archiving on: : Friday, June 4, 2010 - 12:06:17 PM


Publisher files allowed on an open archive


  • HAL Id : ujm-00326243, version 1



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



Record views


Files downloads