搜索资源列表
000-content-with-spaces
- Base class for, um, automata. Could be an NFA or a DFA Source Code for Linux v2.13.6.
ctor_double
- Base class for, um, automata. Could be an NFA or a DFA Source Code for Linux v2.13.6.
DFA_NFA
- NFA to DFA java code
main
- NFA machine to DFA machine
t3
- 编译原理,在Linux环境下实NFA->DNF的转换,使用的语言是C语言- Compiler theory, in the Linux environment real NFA-> DNF conversion, the language used is C language
NFATODFA.c
- Program to convert NFA to DFA
Lexical
- dfa he NFA 之间的转化 非常好用啊 要是需要和我练习-dfa he NFA conversion between ah If there were to be very easy to use and I practice
nfa
- Regular expression implementation. ER to AFD
Lexical
- dfa he NFA 之间的转化 非常好用啊 要是需要和我练习-dfa he NFA conversion between ah If there were to be very easy to use and I practice
NFAtoDFA
- Compiler theory of the NFA is converted to an equivalent DFA C ++ program-Compiler theory of the NFA is converted to an equivalent DFA C++ program
RextoNFA
- 实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
B6MHjIFh
- 编译原理实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
TFPgoodNFA
- The determination of finite automata China, NFA to DFA transformation, a good source
ThompsonNFA
- 这是Thompson将正规式转为NFA的详细算法-Thompson Re to NFA
mzddleware
- 本程序是在VC＋＋环境下编写的利用非确定自动机NFA进行字符串匹配,-This procedure is written in vc++ environment using nondeterministic automata NFA string matching,
automata
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
Chisstring
- 本程序是在VC＋＋环境下编写的利用非确定自动机NFA进行字符串匹配,(This procedure is written in vc + + environment using nondeterministic automata NFA string matching,)
TYPKA111
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
fwdcodefornfa
- program about NFA non deterministic automata algorithm in c++.
新建文件夹
- DFA->NFA->MFA 并依次输出数据表(DFA->NFA->MFA And output the data table in turn)