搜索资源列表
NFA
- 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA N一定存在一个DFA M ,使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出,表项通常是一状态的集合,而在DFA的矩阵表示中,表项是一个状态,NFA到相应的DFA的构造的基本思路是:1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to deter
NFA-DFA.rar
- 实现从nfa到dfa的转换,并且输出中间的状态集以及转换表,From nfa to dfa conversion and output as well as the middle of the state set conversion table
DFA.rar
- 扫描样本字符串,转换成NFA,继续转换,成为DFA,验证此字符串。,Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
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 methods and called for the first
reEX-DFA
- 正则表达式转化为NFA,NFA转化为DFA,DFA最小化-regular expression toDFA
[NFA+TO+DFA]
- [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
NFA-change-to-DFA
- 可以实现NFA到DFA的转换,还可以化简DFA。程序很清晰,详细。-NFA to DFA can achieve the conversion, you can also simplify DFA. Procedures are clear and detailed.
NFA-DFA-MFA
- 正则表达式及NFA-DFA-MFA的转换和判别-Regular expressions and NFA-DFA-MFA conversion and discriminant
Lexical
- dfa he NFA 之间的转化 非常好用啊 要是需要和我练习-dfa he NFA conversion between ah If there were to be very easy to use and I practice
NFATODFA
- NFA到DFA的转换 这是用visual C++ 编写的程序 有注释!-NFA to DFA conversion This is to use visual C++ have the Notes prepared by the procedure!
NFA_DFA
- nfa 到 dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。 -nfa to dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。
NFA_DFA
- 正规(则)表达式转化为NFA,DFA,DFA最小化,显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed
nfa
- 正规式转化为NFA,希望对需要的朋友有用-to NFA
FA
- 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
dfa
- Dfa minimization from nfa
805NFA
- [用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 equivale
lex
- 用c++实现的此法分析器,包括正则表达式解析,正则到NFA转换,NFA到DFA转换,和最终的匹配,详见包中README文件-Using c++ parser to achieve this method, including regular expression analysis, while the NFA is converted, NFA to DFA conversion, and end the match, see the package README file
nfa-dfa
- its nfa-dfa converter
Automate
- graphic Automaton simulator,NFA to DFA conversion and minimisation
DFA
- NFA的确定化算法 C++实现注释清楚详细 代码简单-NFA determination algorithm C++ code is easy to achieve clear and detailed comments