搜索资源列表
DFA.rar
- 编译原理课程设计之正则表达式与自动机之间的变换,Principles of curriculum design to compile regular expressions with the automatic transformation between
RegextoDFA
- 正则表达式转DFA，设计原理：1正则表达式转换为带ε的NFA（Thompson构造法）；2ε-NFA转为DFA；3最小化DFA；4DFA状态转换表判断是否接受输入字符串，附有详细文档说明。-Regular expressions turn DFA, design principles: a regular expression is converted to ε of the NFA (Thompson Construction Law) 2ε-NFA to DFA 3 minimal DF
DFA
- 形式语言中的有穷状态自动机（DFA）的实现，用c#作为开发工具-The form of language has poor state automaton [DFA] of the implementation, using c# as a development tool
DFAshixian
- DFA的输入； DFA的存储与读写； DFA的语言集列表显示； DFA的规则字符串判定； -DFA input DFA storage with reading and writing DFA table shows the language of sets DFA to determine the rules of string
FA
- 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
DFA
- Dfa using some incomings or like this
regToDFA
- 正则表达式到DFA 并能够输出检测结果。输入文件要求： （a|b）* 文件第一行 aaaa 文件第二行 a-Re to DFA
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.
NFA_to_DFA211465612008
- this program convert the nfa into dfa
DFA
- to accept any string from 0`s and 1`s and drow DFA
DeterministicFiniteAutomata_JAVA
- This program is used in a language examination of the DFA. DFA is one type of FA where there is only one alternative state transitions from one state to another using the same input. In this program users can create a new DFA and DFA can be done in
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-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
Formal-conversion-to-DFA
- 正规式转换为DFA 详细的C++代码 并且有分析-Formal conversion to DFA
DFA
- 将编译原理中的正规式转成DFA自动机，用c++实现-The regular expression compiler theory turn into DFA automaton with c++ achieve
DFA-optimal
- 编译原理实验 DFA的最小化 C语言编写 简单控制台程序 适合初学者学习 - DFA compiler principle experiment to minimize the C language Simple console program for beginners to learn
nfa--dfa
- nfa转dfa,c++实现，转自lingyu940的csdn微博-nfa turn dfa, c++ achieve, carried lingyu940 of csdn microblogging
NFA to DFA.cpp
- nfa转换为dfa，一个简单的程序cpp(nfa trans to dfa,a simple program. /.cpp)
DFA
- 用matlab 实现DFA去趋势分析，非常实用的程序(Realization of DFA Detrending Analysis with MATLAB)