Unambiguous Finite Automaton

In automata theory, an unambiguous finite automaton (UFA) is a nondeterministic finite automaton (NFA) such that each word has at most one accepting path. Each deterministic finite automaton (DFA) is an UFA, but not vice versa. DFA, UFA, and NFA recognize exactly the same class of formal languages.
On the one hand, an NFA can be exponentially smaller than an equivalent DFA. On the other hand, some problems are easily solved on DFAs and not on UFAs. For example, given an automaton ''A'', an automaton ''A'' which accepts the complement of ''A'' can be computed in linear time when ''A'' is a DFA, whereas it is known that this cannot be done in polynomial time for UFAs. Hence UFAs are a mix of the worlds of DFA and of NFA; in some cases, they lead to smaller automata than DFA and quicker algorithms than NFA.

Formal definition

An '' NFA'' is represented formally by a 5-tuple, $A=(Q,\Sigma,\Delta,q_0,F)$.
An ''UFA'' is an NFA such that, for each word $w=a_1a_2...a_n$, there exists at most one sequence of states $r_0,r_1,...,r_n$, in $Q$ with the following conditions:
# $r_0=q_0$;
# $r_ \in \Delta (r_i, a_)$ for $i=0,...n-1$;
# $r_n \in F$.
In words, those conditions state that, if $w$ is accepted by $A$, there is exactly one accepting path, that is, one path from an initial state to a final state that is labelled by $w$.

Example

Let $L$ be the set of words over the alphabet whose ''n''th last letter is an $a$. The figures show a DFA and a UFA accepting this language for ''n=2''.

The minimal DFA accepting $L$ has ''2ⁿ'' states, one for each subset of . There is an UFA of $n+1$ states which accepts $L$: it guesses the ''n''th last letter, and then verifies that only $n-1$ letters remain. It is indeed unambiguous as there exists only one ''n''th last letter.

Inclusion, universality, equivalence

Three PSPACE-hard problems for general NFA belong to PTIME for DFA and are now considered.

Inclusion

It is decidable in polynomial-time whether an UFA's language is a subset of another UFA's language.

Let ''A'' and ''B'' be two UFAs. Let ''L''(''A'') and ''L''(''B'') be the languages accepted by those automata. Then ''L''(''A'')⊆''L''(''B'') if and only if ''L''(''A''∩''B'')=''L''(''A''), where ''A''∩''B'' denotes the Cartesian product automaton, which can be proven to be also unambiguous. Now, ''L''(''A''∩''B'') is a subset of ''L''(''A'') by construction; hence both sets are equal if and only if for each length ''n''∈$\mathbb$, the number of words of length ''n'' in ''L''(''A''∩''B'') is equal to the number of words of length ''n'' in ''L''(''A''). It can be proved that is sufficient to check each ''n'' up to the product of the number of states of ''A'' and ''B''.

The number of words of length ''n'' accepted by an automaton can be computed in polynomial time using dynamic programming, which ends the proof.

Universality, equivalence

The problem of universalityi.e.: given a UFA, does it accept every string of Σ^*? and of equivalence,i.e.: given two UFAs, do they accept the same set of strings? also belong to PTIME, by reduction to the inclusion problem.

Checking whether an automaton is unambiguous

For a nondeterministic finite automaton $A$ with $n$ states and an $m$ letter alphabet, it is decidable in time $O(n^2m)$ whether $A$ is unambiguous.

It suffices to use a fixpoint algorithm to compute the set of pairs of states ''q'' and ''q' '' such that there exists a word ''w'' which leads both to ''q'' and to ''q' ''. The automaton is unambiguous if and only if there is no such a pair such that both states are accepting. There are ''Θ''(''n''²) state pairs, and for each pair there are ''m'' letters to consider to resume the fixpoint algorithm, hence the computation time.

Some properties

* Given a UFA ''A'' and an integer ''n'', one can count in polynomial time the number of words of size ''n'' that are accepted by ''A''. This can be done by a simple dynamic programming algorithm: for every state ''q'' of ''A'' and $i\in \$, compute the number of words of size ''n-i'' having a run starting at ''q'' and ending in a final state. By contrast, the same problem is #P-hard for NFAs.
* The cartesian product (intersection) of two UFAs is a UFA.
* The notion of unambiguity extends to finite state transducers and weighted automata. If a finite state transducer ''T'' is unambiguous, then each input word is associated by ''T'' to at most one output word. If a weighted automaton ''A'' is unambiguous, then the set of weight does not need to be a semiring, instead it suffices to consider a monoid. Indeed, there is at most one accepting path.

State complexity

Mathematical proofs that every UFA for a language needs a certain number of states were pioneered by Schmidt. Leung proved that a DFA equivalent to an $n$-state UFA requires $2^n$ states in the worst case, and that a UFA equivalent to a finitely ambiguousHaving finitely many accepting paths for every accepted word. $n$-state NFA requires $2^n-1$ states in the worst case.

Jirásek, Jirásková and Šebej researched state complexity of basic regular operations on languages represented by UFA. They proved in particular that for every $n$-state UFA where $n \geq 7$, the complement of the language it accepts is accepted by a UFA with at most $2^$ states. This result was later improved by Indzhev and Kiefer to at most $\sqrt \cdot 2^$ states for all $n \geq 0$.

Raskin showed that UFAs cannot be complemented in polynomial time, even into NFAs: he shows that, in the worst case, complementing a UFA with ''n'' states into an NFA requires a superpolynomial number of states. This lower bound was later improved by Göös, Kiefer, and Yuan.

For a one-letter alphabet Okhotin proved that a DFA equivalent to an $n$-state UFA requires \exp\left(\Theta\left(\sqrt right)\right) states in the worst case.

Notes

References

* Christof Löding, ''Unambiguous Finite Automata'', ''Developments in Language Theory'', (2013) pp. 29–30
Slides

{{Formal languages and grammars

Finite-state machines