文件名称:nfa
介绍说明－－下载内容均来自于网络，请自行研究使用
把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。
-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 ' .
-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 ' .
(系统自动生成,下载前可以参看下载内容)
下载文件列表
nfa.cpp