搜索资源列表
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 the DFA Recognition
NFASearcher
- NFA的字符串搜索的实例，带分析过程和中间处理信息-NFA search string of examples, with analysis and intermediate processing of information
reg2nfa
- 程序用JAVA语言编写, 综合利用图结构和堆栈结构进行数据组织和处理. 可以进行正则表达式到NFA的转化, 并能用图形直观的表示. 对正则表达式有一些约定, 就是可以用单个字符表示输入, 也可以用 ‘ ‘ 连接起来的一串字符进行输入. 有基本的表达式以及由基本表达式构成的并置, 选择和重复的操作. 例: A|b*c ‘letter’*’digit’ 等都是合法输入. 还带有括号功能, 优先级 -procedures using Java language.
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.
RegextoDFA
- 正则表达式转DFA，设计原理：1正则表达式转换为带ε的NFA（Thompson构造法）；2ε-NFA转为DFA；3最小化DFA；4DFA状态转换表判断是否接受输入字符串，附有详细文档说明。-Regular expressions turn DFA, design principles: a regular expression is converted to ε of the NFA (Thompson Construction Law) 2ε-NFA to DFA 3 minimal DF
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_simulation
- Program to take Nfa as input and a string as input.Check whether string is accepted by NFA or not
nfa_dfaconversion_dfasimulation
- NFA toDFA conversion and then take string as input and check whether String is acceptable by DFA or not
TransformExprTODFA
- 正则表达式转NFA NFA转DFA DFA最小化 测试字符串是否匹配-Transfer NFA NFA regular expression to minimize transfer DFA DFA test whether the string matches
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
DFAaNFA
- 编译原理，判断一个字符串是否满足由DFA和NFA表示的正则表达式-Compiler theory, to determine whether a string meets represented by the DFA and NFA regex
mzddleware
- 本程序是在VC＋＋环境下编写的利用非确定自动机NFA进行字符串匹配,-This procedure is written in vc++ environment using nondeterministic automata NFA string matching,
Chisstring
- 本程序是在VC＋＋环境下编写的利用非确定自动机NFA进行字符串匹配,(This procedure is written in vc + + environment using nondeterministic automata NFA string matching,)