Probabilistic finite-state machines - Part I. - 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 I.


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

Dates and versions

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


  • HAL Id : ujm-00326243 , version 1


Enrique Vidal, Franck Thollard, Colin de La Higuera, Francisco Casacuberta, Rafael C. Carrasco. Probabilistic finite-state machines - Part I.. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27 (7), pp.1013-1025. ⟨ujm-00326243⟩
107 View
4035 Download


Gmail Facebook Twitter LinkedIn More