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 metadatas

Cited literature [59 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-00326243
Contributor : Franck Thollard <>
Submitted on : Thursday, October 16, 2008 - 6:09:11 PM
Last modification on : Wednesday, July 25, 2018 - 2:05:30 PM
Long-term archiving on : Friday, June 4, 2010 - 12:06:17 PM

File

vidal_PFAI.pami05.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : ujm-00326243, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

245

Files downloads

2942