Related Experiment Videos
Probabilistic finite-state machines--part I
Enrique Vidal1, Franck Thollard, Colin de la Higuera
1Departamento 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
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: computational linguistics, machine learning, time series analysis, circuit testing, computational biology, speech recognition, and machine translation are some of them. In Part I of this paper, we survey these generative objects and study their definitions and properties. In Part II, we will study the relation of probabilistic finite-state automata with other well-known devices that generate strings as hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects.
Related Concept Videos
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Probability Laws
Probability in Statistics
An example of a simple event is a coin toss. The result of a coin toss is either a head or a tail. Here, head and tail are two simple events. These two simple events make up the sample space. Further, the probability of an event occurring falls within the range of 0 to 1. The probability of an...
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Piecewise-Defined Functions
Simplified Synchronous Machine Model
In this model, each generator is connected to a...