2 search results - page 1 / 1 » On NFA Reductions |
83
Voted
DLT
2003
14 years 11 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
74
Voted
BIRTHDAY
2004
Springer
15 years 2 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...