搜索资源列表
NFA-DFA
- 词法分析器 NFA DFA 最小化DFA 实验报告-Lexical analyzer NFA DFA
Fraclab-1.0E
- MFDFA in Matlab. It is very useful to apply both DFA and MFDFA to measure the irregular statistics.
Algoritmo-Fractal
- Algorithm of MF-DFA with example Spanish version, of Warsaw
reEX-DFA
- 正则表达式转化为NFA，NFA转化为DFA，DFA最小化-regular expression toDFA
NFA
- nfa to dfa concersion code with regular expression
DFA
- 构造DFA，并输出五元组，运行确定自动机-Constructed DFA, and output 5-tuple, run to determine the automaton
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
DFA
- Compiler tech:Program For Acceptance Of A String Using deterministic finite automaton (DFA) which is a finite state machine accepting finite strings of symbols. For each state, there is a transition arrow leading out to
DFA-optimal
- 正规式转化为NFA,NFA转化为DFA及DFA的最小化-NFA change into DFA
DFA
- MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
DFA
- 将输入的正规式转换为NFA,再转换为DFA.因为时间很赶，所以结构不太合理。注释也不详细。-change from regular express to DFA
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
dfa
- dfa状态转换图的读取和根据图进行路径的判断。是编译原理的重要实验！-dfa state transition diagram of the read path and in accordance with Figure judgment . Important experimental compiler theory !
USER-DFA
- 一个基于c++模板类的dfa程序，可以直接编译运行，环境在linux上成功运行，里面只有一个c文件和h文件-Dfa program based on C++ template class, you can directly compile and run the environment to run successfully on linux, there is only one c file and h file
DFA
- 模拟图状态，识别DFA指定字符串。根据给定的图，识别指定字符序列-Identify the the DFA specified string
nfa-dfa
- 编译原理实验 将nfa到dfa编程实现可在vc 6.0中运行-Principle experiment is compiled nfa dfa programming to run in vc 6.0
DFA
- 正则表达式转化成DFA，运用的是递归算法，编译原理课的实验作业，希望能给大家帮助-Regular expressions into the DFA, the use of a recursive algorithm, and compile the experimental operation of the principle lesson, I hope to give you help
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
dfa
- 简单的DFA转换程序，由正则表达式翻译为DFA-Simple DFA conversion process, the translation of regular expressions to DFA
DFA
- DFA法是检验非平稳时间序列长期相关性的有效方法, 但当时间序列包含高阶趋势时, DFA方法在较 小标度上会产生偏差。-Detrended fluctuation analysis