搜索资源列表
DFAv1
- 关于有穷自动机和正则表达式相互转化的程序，并完成有穷自动机的确定化和最小化。-on Finite Automata and Regular expressions are transformed into each other procedures, and complete the DFA and the determination of the smallest.
compile_work2
- 自动机的确定化，充分理解和掌握NFA、DFA以及NFA确定化过程的相关概念和知识，编程实现对输入NFA转换成DFA输出的功能。-Determination of automata, and fully understand and master the NFA, DFA and NFA to determine the relevance of the concept of process and knowledge of programming to convert NFA to DFA in
shiyan2
- 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum
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 det
dfa
- 数据结构题集答案Data structure problem sets the answer -Data structure problem sets the answer
subsetComput.rar
- 子集法实现NFA到DFA的转换，教学中给学生演示的。图用最简单的方法表示，非常便于理解。纯C代码，在windows和linux都可以编译运行,Subset of the NFA to DFA conversion, teaching to the student demonstration. Figure easiest way, very easy to understand. Pure C code can be compiled to run in windows and linux
gw_Disjoint-Set-DFA-Trie
- 2014年北京大学暑假公开课算法讲解课件之并查集，DFA，Trie图，讲解详细，分析透彻-2014 Peking University summer open class courseware on the algorithm and check collection, DFA, Trie, explain the detailed, thorough analysis
DFA--TO--NFA--simpleDFA
- 程序实现的是编译原理中的NFA到DFA的转换（使用子集构造法）。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA
NFAtoDFA
- Compiler theory of the NFA is converted to an equivalent DFA C ++ program-Compiler theory of the NFA is converted to an equivalent DFA C++ program
DFA算法核心
- DFA算法核心代码，希望大家能善用，如有不全请指教