搜索资源列表
NFAtoDFA[J.S]
- 一个NFA转化为DFA的带有界面的程序，C++builder编写，能够输出转化子集；对于多终结符的情况也一样能够正确求解。-An NFA into a DFA with the interface of the program, C++ builder write to a subset of the output conversion for multi-terminator is also the case can be properly solved.
Finite_Aut2127819222008
- A Program that can convert your Regular Expression to PostFix Post_Fix to NFA [Thomson s Construction] NFA to DFA [Subset Construction] DFA to minDFA [Table Filling Algorithm]
nfatodfa
- NFA转化成DFA的C程序代码，编译原理实验题目-NFA to DFA
Convert_NFA_TO_DFA
- Converting nfa to dfa in java
Compilingpnciplecoursedesign
- NFA的确定化是指对给定的NFA都能相应地构造出一个与之等价的DFA，使它们能够识别相同的语言。NFA的确定化使状态转移的复杂度仅为O(1)，为状态的转移提供了帮助。-Make the NFA refers to the NFA accordingly given to construct a and the equivalent DFA, enables them to identify the same language. Make the NFA to divert the complex
nfa_dfaconversion_dfasimulation
- NFA toDFA conversion and then take string as input and check whether String is acceptable by DFA or not
nfadfa
- This a c program that converts NFA to DFA-This is a c program that converts NFA to DFA
NFAtoDFA(CPP)
- 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
NFA-to-DFA
- 编译原理 NFA 确定化 使用set 有注释，感觉已经很多了-Compiler theory of NFA to determine
main
- 编译原理课程实验，NFA到DFA转换及化简的C++语言实现。-Compiler theory course experiment, NFA to DFA Conversion and Reduction of C++ language.
NFA
- DFA NFA 文件生成转换 C++ 制作源码-DFA NFA file to generate source code conversion C++ production
dfa-nfa
- AFN -> AFD The program convert an AFN (non-deterministic) to AFD (deterministic)
nfa
- 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。 -NFA into a DFA to determine the algorithm to achieve a given NFA M, to det
cifafenxi
- 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular gramm
DFA
- MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
NFA-to-DFA
- Theory: NDFA: It is a mathematical model containing 5 tuples a) Q- finite non empty set elements of which are called as state. b) T- set of alphabets. c) δ- is a mapping function Q*{T {λ}}*2Q d) S-start state i.e. S ε Q e) F- F (su
zhengguishizhuanDFA
- 正规式转DFA，包括正规式转NFA，NFA转DFA等-Formal type turn DFA, including regular type turn NFA, turn NFA DFA, etc..
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
nfa
- this program will convert ndfa to dfa
NFA-EXCHANGE-DFA
- 确定化NFA转化为DFA，这个c++代码用于将NFA转化为DFA ,可以编译通过-The Determination of NFA into DFA