Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.
KeywordsMonotone Function Finite Automaton Average Execution Time Dual Lattice Nondeterministic Automaton
- [Mø04]Møller, A.: dk.brics.automaton (2004), http://www.brics.dk/automaton
- [MS72]Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Symp. Foundations of Computer Science, pp. 125–129. IEEE Computer Society, Los Alamitos (1972)Google Scholar
- [Som98]Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder (1998)Google Scholar