搜索资源列表
DFA.rar
- 编译原理课程设计之正则表达式与自动机之间的变换,Principles of curriculum design to compile regular expressions with the automatic transformation between
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
FA
- 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
regToDFA
- 正则表达式到DFA 并能够输出检测结果。输入文件要求： （a|b）* 文件第一行 aaaa 文件第二行 a-Re to DFA
re2dfa
- 正则表达式到DFA的C程序，很有用的一个小程序，透彻理解DFA算法-Regular expressions to DFA' s C program, a small program useful, thorough understanding of the DFA algorithm
p1
- 简单的从正则表达式到有穷自动机的转换，你值得拥有哈~-From the simple regular expressions to DFA conversion, you deserve ha ~