The Community for Technology Leaders
Green Image
Issue No. 07 - July (2005 vol. 27)
ISSN: 0162-8828
pp: 1026-1039
Enrique Vidal , IEEE Computer Society
Francisco Casacuberta , IEEE Computer Society
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{\hbox{-}}{\rm grams} and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
Index Terms- Automata, classes defined by grammars or automata, machine learning, language acquisition, language models, language parsing and understanding, machine translation, speech recognition and synthesis, structural pattern recognition, syntactic pattern recognition.

F. Thollard, R. C. Carrasco, F. Casacuberta, E. Vidal and C. de la Higuera, "Probabilistic Finite-State Machines-Part II," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 27, no. , pp. 1026-1039, 2005.
94 ms
(Ver 3.3 (11022016))