两种εNDFA确定化方法的讨论

Discussion on two Methods for Converting εNDFA to DFA

在自动机理论中,εNDFA的确定化有直接确定化和间接确定化两种方法.通过讨论和实例分析,得出这样一个结论:对同一个εNDFA进行直接或间接的确定化后各自所得到的DFA不一定相同,但最小化DFA是唯一的.

There are direct and indirect methods for converting a εNDFA （Nondeterministic Finite Automata that can accept the null string） to an equivalent DFA （Deterministic Finite Automata）. Through discussion and several examples, the results demonstrate that direct or indirect conversion for the same cNDFA may get an identical or different DFA respectively, but the minimum DFA for every equivalent DFA is unique.