Location:
Search - DFA
Search list
Description: 可以实现NFA到DFA的转换，还可以化简DFA。程序很清晰，详细。-NFA to DFA can achieve the conversion, you can also simplify DFA. Procedures are clear and detailed.
Platform: |
Size: 2048 |
Author: 火麒麟 |
Hits:
Description: 词法分析器 NFA DFA 最小化DFA 实验报告-Lexical analyzer NFA DFA
Platform: |
Size: 46080 |
Author: huang |
Hits:
Description: MFDFA in Matlab. It is very useful to apply both DFA and MFDFA to measure the irregular statistics.
Platform: |
Size: 7387136 |
Author: tsubasa14 |
Hits:
Description: Algorithm of MF-DFA with example Spanish version, of Warsaw
Platform: |
Size: 2863104 |
Author: McGufalo |
Hits:
Description: 正则表达式转化为NFA，NFA转化为DFA，DFA最小化-regular expression toDFA
Platform: |
Size: 183296 |
Author: 孙林晶 |
Hits:
Description: nfa to dfa concersion code with regular expression
Platform: |
Size: 7168 |
Author: sourav |
Hits:
Description: 构造DFA，并输出五元组，运行确定自动机-Constructed DFA, and output 5-tuple, run to determine the automaton
Platform: |
Size: 1024 |
Author: 王梦 |
Hits:
Description: 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 grammar G, write a regular expression RE 3, according to the regular expression RE, draw the NFA 4, the NFA into a DFA 5, the DFA conversion the mininum state DFA 6, mininum state DFA is the lexical analysis process flow chart, flow chart according to the preparation of the corresponding lexical analyzer.
Platform: |
Size: 6144 |
Author: 晓 |
Hits:
Description: 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 a next state for each symbol. Upon reading a symbol, a DFA jumps deterministically from a state to another by following the transition arrow
Platform: |
Size: 1024 |
Author: jack |
Hits:
Description: 正规式转化为NFA,NFA转化为DFA及DFA的最小化-NFA change into DFA
Platform: |
Size: 1035264 |
Author: 流木0911 |
Hits:
Description: MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
Platform: |
Size: 4697088 |
Author: 流木0911 |
Hits:
Description: 将输入的正规式转换为NFA,再转换为DFA.因为时间很赶，所以结构不太合理。注释也不详细。-change from regular express to DFA
Platform: |
Size: 46080 |
Author: 蓝 |
Hits:
Description: 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 (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-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 (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits:
Description: dfa状态转换图的读取和根据图进行路径的判断。是编译原理的重要实验！-dfa state transition diagram of the read path and in accordance with Figure judgment . Important experimental compiler theory !
Platform: |
Size: 2966528 |
Author: 俞颢 |
Hits:
Description: 一个基于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
Platform: |
Size: 15360 |
Author: 张展 |
Hits:
Description: 模拟图状态，识别DFA指定字符串。根据给定的图，识别指定字符序列-Identify the the DFA specified string
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 编译原理实验 将nfa到dfa编程实现可在vc 6.0中运行-Principle experiment is compiled nfa dfa programming to run in vc 6.0
Platform: |
Size: 2048 |
Author: ANGELO |
Hits:
Description: 正则表达式转化成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
Platform: |
Size: 3410944 |
Author: 陈予诚 |
Hits:
Description: 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Platform: |
Size: 84992 |
Author: 若若 |
Hits:
Description: 简单的DFA转换程序，由正则表达式翻译为DFA-Simple DFA conversion process, the translation of regular expressions to DFA
Platform: |
Size: 2048 |
Author: 王伟 |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
34
»