Location:
Search - S-DFA
Search list
Description: 本程序为编译原理里的一个重要的知识点，实现NFA到DFA的转换-procedures for the compiler's a principle important knowledge points, for the NFA to DFA conversion
Platform: |
Size: 31449 |
Author: 李小刚 |
Hits:
Description: 简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)，设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价，记为p≡q。而且，≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态
Platform: |
Size: 8892 |
Author: David |
Hits:
Description: 该C++源码为正规式到有穷自动机的转化过程的实现-C source code for the formal ceremony to DFA's transformation process to achieve
Platform: |
Size: 14141 |
Author: 王里 |
Hits:
Description: 简单的词法分析程序 1)通过理解正规式、有限自动机原理，根据下面的X语言的说明编制一个X语言的词法分析程序。 (2)提交实验报告，报告内容如下： 目的要求、DFA、程序清单（带注释）、测试样例及结果-simple lexical analysis procedure 1) understanding through informal style, Finite Automata Theory, according to the following X-language statement prepared an X language lexical analysis procedure. (2) the author's experimental report, which reads as follows : Objective, DFA, procedures list (with Notes), and sample test results
Platform: |
Size: 1331 |
Author: 寻好 |
Hits:
Description: 本程序为编译原理里的一个重要的知识点，实现NFA到DFA的转换-procedures for the compiler's a principle important knowledge points, for the NFA to DFA conversion
Platform: |
Size: 30720 |
Author: 李小刚 |
Hits:
Description: 简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)，设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价，记为p≡q。而且，≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态-Simplify the DFA-for a defined automaton M = (K, Σ, Δ, s, F), set p, q ∈ K, if for any string w, from p along w up to a certain destination if and only if along w from q up to a certain destination, then that p, q equivalent is recorded as p ≡ q. Moreover, ≡ an equivalence class is just the least number of states determine the type of a state automaton
Platform: |
Size: 8192 |
Author: David |
Hits:
Description: 正则表达式到NFA，NFA到DFA的JAVA实现，图形表示结果。-Regular Expression to NFA, NFA to DFA s JAVA realized, graphical representation of results.
Platform: |
Size: 35840 |
Author: 洪兴 |
Hits:
Description: NFA的确定化是编译过程中一个重要的部分，由于本程序的输入很多，而且有多种格式的输入，所以输入时必须非常小心细致。本程序比较复杂，需要使用多个结构体并使用了指针。必须将程序分解为多个子程序以降低编写难度。想起了软工老师的一句话：＂难事破与易＂，再复杂的事，拆成一个个简单的小部分，逐个击破，在拼凑起来，复杂的事也变的简单了。适当使用全局常量可以控制有效控制内存溢出。由于程序较大，调试时多人协作能更容易易找出程序并成功修改。-NFA determination is the process of compiling an important part, due to the importation of many of the procedures, but also a variety of formats input, so input must be very careful and meticulous. This procedure is rather complicated, the need to use multiple structures and use the pointer. Procedures must be decomposed into a number of subroutines to reduce the difficulty of preparation. Soft workers thought of the teacher s words: difficult to break and easy , and then a complex issue, is split into a small portion of a simple, one by one break in together, things have changed the complexity of the simple. Proper use of global constants can be controlled effectively control memory overflow. Because of the larger process, debugging collaboration when people can easily find out the procedure more easily and successfully modified.
Platform: |
Size: 149504 |
Author: 佚星 |
Hits:
Description: 本程序是用来解决消除趋势波动分析的MATLAB程序-This procedure is used to address the elimination of detrended fluctuation analysis of the MATLAB program
Platform: |
Size: 2048 |
Author: 于剑 |
Hits:
Description: 利用有穷确定自动机M=(K,Σ,f, S,Z）行为模拟程序算法，来对于任意给定的串，若属于该语言时，该过程经有限次计算后就会停止并回答“是”，若不属于，要么能停止并回答“不是”-利用有穷确定自动机M=(K,Σ,f, S,Z）行为模拟程序算法，来对于任意给定的串，若属于该语言时，该过程经有限次计算后就会停止并回答“是”，若不属于，要么能停止并回答“不是”
Platform: |
Size: 1024 |
Author: huangyiwei |
Hits:
Description: [用Java语言实现nfa到DFA的等价变换.rar] - 本程序为编译原理里的一个重要的知识点，实现nfa到DFA的转换
[nfatoDFA.rar] - nfa转化为DFA的一个程序!希望能有点作用!
[REManageAndnfaToDFA.rar] - 能够完成正规式到nfa的转换，NFA到DFA的转换（子集法）,DFA的最小化，测试一个生成串是否能为生成的DFA所识别
-[Using Java language to the DFA' s nfa equivalent transformation. Rar]- This procedure is compiled in an important principle of knowledge, the realization of nfa to DFA conversion [nfatoDFA.rar]- nfa into a DFA program! Hope role can be a little bit! [REManageAndnfaToDFA.rar]- to the completion of the formal ceremony to nfa conversion, NFA to DFA conversion (a subset of the Law), DFA minimization, testing whether a string can be generated for the generated DFA identified
Platform: |
Size: 10240 |
Author: 董华鹏 |
Hits:
Description: 一个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.
Platform: |
Size: 1088512 |
Author: 卓然 |
Hits:
Description: 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]
Platform: |
Size: 45056 |
Author: csp |
Hits:
Description: 简单登陆系统 挺简单的，就不用多说了！非要20个字符！-this is a asp code asd lfkja sdfa sfd asdf sads fa s dfa s df
Platform: |
Size: 10240 |
Author: 加薪 |
Hits:
Description: to accept any string from 0`s and 1`s and drow DFA
Platform: |
Size: 44032 |
Author: MK |
Hits:
Description: 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.
Platform: |
Size: 821248 |
Author: Behzad Solaymoney |
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: 生物医学工程年会文章
使用非线性方法MF-DFA分析EMG信号的很好的文章-Annals of Biomedical Engineering
Detecting long-range correlations of operating force and sEMG with multifractal
detrended fluctuation analysis
Platform: |
Size: 828416 |
Author: lifan |
Hits:
Description: DFA的Java实现，最近有编译原理的实习，就把自己的资源共享给大家-
DFA s Java implementation, recent internship compiler theory, put their own resources for everyone to share
Platform: |
Size: 48128 |
Author: 张春亮 |
Hits:
Description: 对方的事发生 第三方的身份多少地方第三方第三方多少范德萨范德萨(How much is the third party's identity of the other party? How many places are the third party and the third party? How many Sar Sar?)
Platform: |
Size: 13312 |
Author: 第三方碍事 |
Hits: