title: Probabilistic finite-state machines--part II.
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.
authors: Departamento de Sistemas Informáticos y Computación and Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Camino de Vera s/n, E-46071 Valencia, Spain. evidal@iti.upv.es
authors: Enrique
authors: E
authors: Vidal
authors: Frank
authors: F
authors: Thollard
authors: Colin
authors: C
authors: de la Higuera
authors: Francisco
authors: F
authors: Casacuberta
authors: Rafael C
authors: RC
authors: Carrasco
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003198:Computer Simulation; D016247:Information Storage and Retrieval / Q000379:methods*; D015233:Models, Statistical; D009323:Natural Language Processing; D009716:Numerical Analysis, Computer-Assisted; D010363:Pattern Recognition, Automated / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods; D017421:Sequence Analysis / Q000379:methods; D012815:Signal Processing, Computer-Assisted