搜索资源列表
REManageAndNFAToDFA
- 能够完成正规式到NFA的转换,NFA到DFA的转换(子集法),DFA的最小化,测试一个生成串是否能为生成的DFA所识别-to complete the formal ceremony to change the NFA, NFA conversion to DFA (subset), the smallest of DFA, testing whether a string of generation to generation by
COMPILEPAPER
- 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。-compile detailed design documentation, including NFA -
050420106wangmeijun
- 编译课程设计,有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化
Simple_DFA
- DFA状态最少化的算法,即DFA的最小化
zhengguishizhuanNFAheDFAjizuixiaohua
- 用图实现的正规式转NFA转DFA,及对DFA的最小化实现。
nfa_dfa
- 求正规表达式到NFA(不确定的有限自动机),NFA到DFA及DFA(有限自动机)的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.
DFAv1
- 关于有穷自动机和正则表达式相互转化的程序,并完成有穷自动机的确定化和最小化。-on Finite Automata and Regular expressions are transformed into each other procedures, and complete the DFA and the determination of the smallest.
REManageAndNFAToDFA
- 能够完成正规式到NFA的转换,NFA到DFA的转换(子集法),DFA的最小化,测试一个生成串是否能为生成的DFA所识别-to complete the formal ceremony to change the NFA, NFA conversion to DFA (subset), the smallest of DFA, testing whether a string of generation to generation by
COMPILEPAPER
- 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。-compile detailed design documentation, including NFA-
bianyiyuanli
- 输入一个正则表达式(也可以预先将一些测试的正则表达式输入到文件中) (2)输出相应的NFA图(要求用画图方法完成并要求是逐步逐步进行画,好象书本P47例2.12和2.13一样逐步得到结果) (3)NFA转换为DFA(得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图) (4)DFA最小化(也要求用画图方法完成) (5)选做部分:将最小化DFA所对应的识别程序自动产生出来。
050420106wangmeijun
- 编译课程设计,有穷自动机的确定化与最小化,完成了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
AutoMake5.0
- 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the fi
nfa_dfa
- 输入一个正则表达式,输出相应的NFA图,NFA转换为DFA,将DFA最小化。-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA, the DFA minimization.
Simple_DFA
- DFA状态最少化的算法,即DFA的最小化-DFA state minimization algorithm, namely, DFA Minimization
zhengguishizhuanNFAheDFAjizuixiaohua
- 用图实现的正规式转NFA转DFA,及对DFA的最小化实现。-With plans to achieve a formal ceremony to NFA to DFA, and the smallest of the realization of DFA.
DFA
- 输入一个正则表达式,输出相应的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 met
NFA_DFA
- nfa 到 dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。 -nfa to dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。
805NFA
- [用Java语言实现nfa到DFA的等价变换.rar] - 本程序为编译原理里的一个重要的知识点,实现nfa到DFA的转换 [nfatoDFA.rar] - nfa转化为DFA的一个程序!希望能有点作用! [REManageAndnfaToDFA.rar] - 能够完成正规式到nfa的转换,NFA到DFA的转换(子集法),DFA的最小化,测试一个生成串是否能为生成的DFA所识别 -[Using Java language
DFA-optimal
- 正规式转化为NFA,NFA转化为DFA及DFA的最小化-NFA change into DFA
DFA-optimal
- 编译原理实验 DFA的最小化 C语言编写 简单控制台程序 适合初学者学习 - DFA compiler principle experiment to minimize the C language Simple console program for beginners to learn