Probabilistic finite-state machines - Part II.

Enrique Vidal (1) , Franck Thollard (2) , Colin de La Higuera (2) , Francisco Casacuberta (1) , Rafael C. Carrasco (3)

1 UPV - Universitat Politècnica de València
2 LHC - Laboratoire Hubert Curien
3 UPA - Universitad Politecnica de Alicante

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.

Domains: Artificial Intelligence [cs.AI]

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⟩