Description: NFA into a DFA to determine the algorithm to achieve a given NFA M, to determine into a DFA M ' , then the DFA M state minimization, given DFA M of finite state set S is divided into several disjoint subset, such that: any two different subset of the state are distinguishable, and the same subset of any two states are equivalent (to take advantage of Ia function, but does not need to construct ε-CLOSURE function, because This is a DFA). Output of the simplified DFA M ' .
To Search:
File list (Check if you may need any files):
nfa.cpp
Download