搜索资源列表
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
tam
- 编译原理词法分析程序，编写简单语言的词法分析程序，掌握从正规式到有穷自动机，再到有穷自动机最小化，最后完成编成的流程及相关技术。-Principles of lexical analysis program to compile, prepare a simple lexical analysis of language to grasp from the formal ceremony to DFA, DFA to minimize the process of finalizing the
Regular-expres
- 实现有穷自动机，NFA到DFA的最小化，实现最长匹配-Realization of finite automata, NFA to DFA, minimize, the longest match
DFA-optimal
- 编译原理实验 DFA的最小化 C语言编写 简单控制台程序 适合初学者学习 - DFA compiler principle experiment to minimize the C language Simple console program for beginners to learn
DFA
- NFA化为DFA，并将DFA最小化，输出最小化后的DFA的状态转化矩阵。-NFA into a DFA, and minimize DFA, DFA minimize output condition after transformation matrix.
实验2
- 将NFA转为DFA并最小化，从excel表中读入，并输出每一步的结果，(transform NFA to DFA)