Weighted automaton

In theoretical computer science and formal language theory, a weighted automaton or weighted finite-state machine is a generalization of a finite-state machine in which the edges have weights, for example real numbers or integers. Finite-state machines are only capable of answering decision problems; they take as input a string and produce a Boolean output, i.e. either "accept" or "reject". In contrast, weighted automata produce a quantitative output, for example a count of how many answers are possible on a given input string, or a probability of how likely the input string is according to a probability distribution. They are one of the simplest studied models of quantitative automata.

Hasse diagram of some classes of quantitative automata, ordered by expressiveness.

The definition of a weighted automaton is generally given over an arbitrary semiring $R$, an abstract set with an addition operation $+$ and a multiplication operation $\times$. The automaton consists of a finite set of states, a finite input alphabet of characters $\Sigma$ and edges which are labeled with both a character in $\Sigma$ and a weight in $R$. The weight of any path in the automaton is defined to be the product of weights along the path, and the weight of a string is the sum of the weights of all paths which are labeled with that string. The weighted automaton thus defines a function from $\Sigma ^{*}$ to $R$.

Weighted automata generalize deterministic finite automata (DFAs) and nondeterministic finite automata (NFAs), which correspond to weighted automata over the Boolean semiring, where addition is logical disjunction and multiplication is logical conjunction. In the DFA case, there is only one accepting path for any input string, so disjunction is not applied. When the weights are real numbers and the outgoing weights for each state add to one, weighted automata can be considered a probabilistic model and are also known as probabilistic automata. These machines define a probability distribution over all strings, and are related to other probabilistic models such as Markov decision processes and Markov chains.

Weighted automata have applications in natural language processing where they are used to assign weights to words and sentences, as well as in image compression. They were first introduced by Marcel-Paul Schützenberger in his 1961 paper On the definition of a family of automata. Since their introduction, many extensions have been proposed, for example nested weighted automata, cost register automata, and weighted finite-state transducers. Researchers have studied weighted automata from the perspective of learning a machine from its input-output behavior (see computational learning theory) and studying decidability questions.

Definition

A commutative semiring (or rig) is a set R equipped with two distinguished elements $0\neq 1$ and addition and multiplication operations $\oplus$ and $\otimes$ such that $\oplus$ is commutative and associative with identity $0$, $\otimes$ is commutative and associative with identity $1$, $\otimes$ distributes over $\oplus$, and 0 is an absorbing element for $\otimes$.

A weighted automaton over $R$ is a tuple ${\mathcal {A}}=(Q,\Sigma ,\Delta ,I,F)$ where:

• $Q$ is a finite set of states.
• $\Sigma$ is a finite alphabet.
• $\Delta \subseteq Q\times \Sigma \times R\times Q$ is a finite set of transitions $(q,\sigma ,w,q')$, where $\sigma$ is called a character and $w$ is called a weight.
• $I:Q\to R$ is an initial weight function.
• $F:Q\to R$ is a final weight function.

A path on input $w\in \Sigma ^{*}$ is a finite path in the graph, where the concatenation of the character labels equals $w$. The weight of the path $q_{0},q_{1},\ldots ,q_{n}$ is the product ($\otimes$) of the weights along the path, additionally multiplied by the initial and final weights $I(q_{0})\otimes I(q_{n})$. The weight of the word $w$ is the sum ($\oplus$) of the weights of all paths on input $w$ (or 0 if there are no accepting paths). In this way the machine defines a function $[\![{\mathcal {A}}]\!]:\Sigma ^{*}\to R$.

Ambiguity and determinism

Since $\Delta$ is a set of transitions, weighted automata allow multiple transitions (or paths) on a single input string. Therefore a weighted automaton can be considered analogous to a nondeterministic finite automaton (NFA). As is the case with NFAs, restrictions of weighted automata are considered that correspond to the concepts of deterministic finite automaton and unambiguous finite automaton (deterministic weighted automata and unambiguous weighted automata, respectively).

First, a preliminary definition: the underlying NFA of ${\mathcal {A}}$ is an NFA formed by removing all transitions with weight $0$ and then erasing all of the weights on the transitions $\Delta$, so that the new transition set lies in $Q\times \Sigma \times Q$. The initial states and final states are the set of states $q$ such that $I(q)\neq 0$ and $F(q)\neq 0$, respectively.

A weighted automaton is deterministic if the underlying NFA is deterministic and unambiguous if the underlying NFA is unambiguous. Every deterministic weighted automaton is unambiguous.

In both the deterministic and unambiguous cases, there is always at most one accepting path, so the $\oplus$ operation is never applied and can be omitted from the definition.

Variations

• The requirement that there is a zero element for $\oplus$ is sometimes omitted; in this case the machine defines a partial function from $\Sigma ^{*}$ to $R$ rather than a total function.

• It is possible to extend the definition to allow epsilon transitions $(q,\epsilon ,w,q')$, where $\epsilon$ is the empty string. In this case, one must then require that there are no cycles of epsilon transitions. This does not increase the expressiveness of weighted automata. If epsilon transitions are allowed, the initial weights and final weights can be replaced by initial and final sets of states without loss of expressiveness.

• Some authors omit the initial and final weight functions $I$ and $F$. Instead, $I$ and $F$ are replaced by a set of initial and final states. If epsilon transitions are not present, this technically decreases expressiveness as it forces $[\![{\mathcal {A}}]\!](\varepsilon )$ to depend only on the number of states that are both initial and final.

• The transition function can be given as a matrix $\Delta _{\sigma }\in R^{Q\times Q}$ with entries in $R$ for each $\sigma$, rather than a set of transitions. The entry of the matrix at $(q,q')$ is the sum of all transitions labeled $(q,\sigma ,q')$.

• Some authors restrict to specific semirings, such as $\mathbb {N}$ or $\mathbb {Z}$, particularly when studying decidability results.

See also

• Probabilistic automaton
• Nondeterministic finite automaton
• Finite-state transducer
• Rational series
• Semiring
• Matrix ring
• Timed automaton
• Fuzzy logic
• Markov chain