搜索资源列表
Regular
- 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end; * Closure; , And set; To complement the set; E, empty
DFA.rar
- 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。,Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
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
NFA
- NFA字符串识别演示程序比较复杂点，也需要建力一个专门的存储)的堆栈-NFA string recognition demo program more complicated points, also need to build a dedicated power storage) stack
nfa_dfaconversion_dfasimulation
- NFA toDFA conversion and then take string as input and check whether String is acceptable by DFA or not
NFA
- 编译原理实验 NFA识别语言的java实现，为NFA.java文件中的NFA类实现成员函数boolean recognizeString(int move[][][], int accept_state[], String word).-Principle experiment NFA compile the java language to achieve recognition for NFA.java file NFA class implements member functions b
NFA
- 输入字符串，首先输出NFA，然后将会输出对应的DFA，最后输出简化的DFA-you can input a string,and then,the program will output NFA DFA and simplest DFA