## Probabilistic Finite-State Machines - Part II

by
E. Vidal
,
F. Thollard
,
C. De La Higuera
,
F. Casacuberta
,
R. C. Carrasco

Citations: | 10 - 2 self |

### BibTeX

@MISC{Vidal_probabilisticfinite-state,

author = {E. Vidal and F. Thollard and C. De La Higuera and F. Casacuberta and R. C. Carrasco},

title = {Probabilistic Finite-State Machines - Part II},

year = {}

}

### OpenURL

### 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 n- grams, and provide theorems, algorithms and properties that represent a current state of the art of these objects.