搜索资源列表
nfa
- Nfa simulator Non deterministic Automata
jflex-1.4.3.tar
- jflex-1.4.3 new opensource java flex project to convert NFA to DFA-jflex-1.4.3 new opensource java flex project to convert NFA to DFA
nfa
- nfa design and information of regular expression
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
NFAtoDFA
- It s a program that convert NFA(Non deterministic Finite Automata) to DFA(Deterministic Finite Automata). This article used in scanners and parsers to detect some pattern of input characters similar to tokens.
nfa.c
- This program is used to covert regular expression into NFA in compiler design.
nfa
- NFA algorithm to show the nfa of a given regular expression
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
NFAtoDFA
- 内容：自动机编程，NFA转换DFA程序，将输入的NFA转换为DFA-Content: automatic machine programming, NFA DFA conversion procedure to convert the input of the NFA to DFA
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
NFA
- 编译原理实验 NFA识别语言的java实现，为NFA.java文件中的NFA类实现成员函数boolean recognizeString(int move[][][], int accept_state[], String word).-Principle experiment NFA compile the java language to achieve recognition for NFA.java file NFA class implements member functions b
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
nfa-dfa
- 编译原理实验 将nfa到dfa编程实现可在vc 6.0中运行-Principle experiment is compiled nfa dfa programming to run in vc 6.0
NFA
- 我只做到了转化成NFA的阶段~希望可以给大家一些帮助~-I only did the stage into the NFA ~ hope can give us some help ~
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
NFA
- 输入字符串，首先输出NFA，然后将会输出对应的DFA，最后输出简化的DFA-you can input a string,and then,the program will output NFA DFA and simplest DFA
NFA
- 为NFA.java文件中的NFA类实现成员函数boolean recognizeString(in mov[][],int accept_state[],Strin word)-For the NFA in NFA.java file class member function boolean recognizeString (in mov [] [], int accept_state [], Strin word)
DFA、NFA的java代码实现
- DFA、NFA的java代码实现，代码简单易懂，并附有可以运行的脚本文件，以及程序的说明文档-DFA, NFA' s java code, easy-to-understand code, with a scr ipt file that can be run, as well as the program' s documentation