next up previous
Next: Minimization Up: Operations on Finite Automata Previous: Regular expressions


The -d option is used to determinize a finite state automaton. Standard input consists of the finite-state automaton to be determinized. The determinized finite-state automaton is written to standard output. The determinization algorithm uses a version of the subset construction (Hopcroft and Ullman [6]) in which only those subsets are considered that can be reached from an initial state. Example:

% fsa -d aabbaabb.nd | fsa -tex -q 0 > aabbaabb.pic

This results in the following LATEX picture of the determinized automaton:
\par % state q0
\thinlines\put(670.0,-225.0){\makebox(0,0){\footnotesize b}}

Noord G.J.M. van