Description: 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化-Compiler design, finite automata to identify and minimize the completion of the DFA, NFA, RE between the conversion and DFA Minimization Platform: |
Size: 3577856 |
Author:junjun |
Hits:
Description: 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成）
-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method) Platform: |
Size: 14336 |
Author:liyingan |
Hits:
Description: 正规(则)表达式转化为NFA，DFA，DFA最小化，显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed Platform: |
Size: 2227200 |
Author:杨心海 |
Hits:
Description: [用Java语言实现nfa到DFA的等价变换.rar] - 本程序为编译原理里的一个重要的知识点，实现nfa到DFA的转换
[nfatoDFA.rar] - nfa转化为DFA的一个程序!希望能有点作用!
[REManageAndnfaToDFA.rar] - 能够完成正规式到nfa的转换，NFA到DFA的转换（子集法）,DFA的最小化，测试一个生成串是否能为生成的DFA所识别
-[Using Java language to the DFA' s nfa equivalent transformation. Rar]- This procedure is compiled in an important principle of knowledge, the realization of nfa to DFA conversion [nfatoDFA.rar]- nfa into a DFA program! Hope role can be a little bit! [REManageAndnfaToDFA.rar]- to the completion of the formal ceremony to nfa conversion, NFA to DFA conversion (a subset of the Law), DFA minimization, testing whether a string can be generated for the generated DFA identified Platform: |
Size: 10240 |
Author:董华鹏 |
Hits:
Description: 已知一个正则表达式,把它转化为dfa,nfa转化为dfa,dfa最小化 完全可以用，很好很强大！-Given a regular expression, put it into a dfa, nfa into dfa, dfa minimization can use, very very powerful! Platform: |
Size: 6144 |
Author:解决 |
Hits:
Description: 把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 ' . Platform: |
Size: 2048 |
Author:王静晓 |
Hits:
Description: DFA算法的最小化之Java实现，可直接编译使用版-DFA minimization algorithm implemented in Java, can be directly compiled to use version Platform: |
Size: 3072 |
Author:宗建 |
Hits:
Description: C#实现最小DFA算法。化简DFA为最小化的DFA。图形介面。-C# implementation of the minimum DFA algorithm. Simplified DFA for the minimization of the DFA. Graphics interface.
Platform: |
Size: 71680 |
Author:李萌萌 |
Hits:
Search - dfa minimization