搜索资源列表
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
DFA
- 形式语言与自动机中DFA(确定的有限自动机)的java实现-Formal Languages and Automata (DFA) to achieve the java
3-bianyichengxu-ppt
- 编译原理资料：第三章，词法分析。词法分析器的设计与实现，正规表达式与有穷自动机，正规文法与正规式，正规文法与有限自动机的等价性-Compiler theory Information: Chapter III, lexical analysis. Design and implementation of lexical analyzer, regular expressions and finite automata, formal grammars and formal style, form
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)
NFA
- The transformation of the formal grammar to the uncertain automata, the content of the lexical analyzer