Browse by topic
Type of publication
Probabilistic finite-state machines - Part II. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005. Vol. 27 (7), pp. 1025-1039.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.