A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An automaton-based task is in general more efficient when performed with a DFA rather than an NFA. For any NFA there equivalent that generated by the classical Subset Construction algorithm. When, however, large may transformed into series of actions operating directly on NFA, unnecessarily expensive computation, as...
