搜索资源列表
NFA
- 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法，-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
uncertain-finite-automata-determine
- 不确定有限状态自动机的确定化，不确定有限状态自动机的确定化-The uncertain finite state automata determine
NFA_TO_DFA
- 不确定有限状态自动机的确定化(NFA_TO_DFA) 编译原理实验-Uncertain finite state automaton and the determination of (NFA_TO_DFA) Compiler Principle Experiment
ReFa.tar
- 正规文法到不确定自动机的转换，词法分析器的内容(The transformation of the formal grammar to the uncertain automata, the content of the lexical analyzer)
ReFa
- 词法分析器，自动机和不确定化的自动机有关内容(The transformation of the formal grammar to the uncertain automata, the content of the lexical analyzer)
op
- 有关自动机和不确定自动机的转换编程，NFA(The transformation of the formal grammar to the uncertain automata, the content of the lexical analyzer)