搜索资源列表
DFA自动版
- 我的编译原理大作业，自动分析语法，判断语句是否符合规则。DFA即有穷自动机。因为这个工作量比较大，所以恕我不无帐号发放了。-I build large operating principle, automatic syntax analysis, judgment statement with the rules. DFA that the DFA. Because the workload is bigger, it is not without regret that I paid the
DFA
- 编译原理试验，dfa简单编译器，以定义好正则式（a|b）*ab,输入字符串，可以判断是否可以接受。
DFA
- 确定型有限状态机的实现：把DFA的五元组存在文本文件中，输入一个字符串可以判断能否被该机器所接受
DFA
- DFA确定型有穷自动机的相关功能 不用修改直接可用
DFA
- DFA的一个例子，有点意思，希望对大家有所帮助，
dfa
- 由输入的正规式自动生成NFA，再转换为DFA。再对指定的文件进行处理。找出该文件中与正规式匹配的子串。
DFA
- 输入正规式, 画出对应的NFD, DFA,
DFA
- 编译原理初学者适用，DFA，有穷自动机的功能实现
DFA
- DFA,这个一个关于确定有限自动机的算法,有兴趣可以参考一下.-DFA, a set of finite automata algorithms are interested can take a look.
NFA转换成DFA
- C++实现NFA转换成DFA
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
[NFA+TO+DFA]
- [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
NFA-DFA-MFA
- 正则表达式及NFA-DFA-MFA的转换和判别-Regular expressions and NFA-DFA-MFA conversion and discriminant
DFA
- 调试了一个简单的DFA程序，可以作为借鉴，比较实用的程序。-Debug a simple DFA procedures, can be used as reference, more practical procedures.
dfa
- Dfa minimization from nfa
nfa-dfa
- its nfa-dfa converter
DFA
- 简单DFA有穷自动机，可以根据输入的状态转换表，进行状态转换，对输入的字符串判断，该自动机是否可以接受。并有具体报告说明。-Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific