Welcome![Sign In][Sign Up]
Location:
Search - NFA to DFA Algorithm

Search list

[ELanguageNFA

Description: 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA  N一定存在一个DFA M ,使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出,表项通常是一状态的集合,而在DFA的矩阵表示中,表项是一个状态,NFA到相应的DFA的构造的基本思路是:1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
Platform: | Size: 10067 | Author: | Hits:

[ELanguagenfa

Description: NFA DFA相关算法 编译原理的一个实验内容 使用VC++打开-NFA DFA correlation algorithm compiler principles of the use of an experimental content VC Open
Platform: | Size: 105472 | Author: chuhaiyun | Hits:

[ELanguageNFA

Description: 实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA  N一定存在一个DFA M ,使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出,表项通常是一状态的集合,而在DFA的矩阵表示中,表项是一个状态,NFA到相应的DFA的构造的基本思路是:1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .
Platform: | Size: 10240 | Author: | Hits:

[Data structsNFtoDFA

Description: 正则表达式转换为有穷自动机的算法,用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.
Platform: | Size: 279552 | Author: Y.A.M | Hits:

[ELanguageSimple_DFA

Description: DFA状态最少化的算法,即DFA的最小化-DFA state minimization algorithm, namely, DFA Minimization
Platform: | Size: 3072 | Author: 侯坤 | Hits:

[AlgorithmFinite_Aut2127819222008

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:

[Program docChapter2

Description: 编译原理第二章的ppt 内容包含语法描述 NFA到DFA 以及DFA最小化的算法-Compiler Construction Principles Chapter II contains the ppt Syntax Description NFA to DFA and DFA minimization algorithm
Platform: | Size: 124928 | Author: pengjun | Hits:

[ELanguageDFA

Description: NFA的确定化算法 C++实现注释清楚详细 代码简单-NFA determination algorithm C++ code is easy to achieve clear and detailed comments
Platform: | Size: 8192 | Author: pengjun | Hits:

[ELanguageNFA-CONVERT-TO-DFA

Description: 编写程序读取nfa.txt,构造出NFA的数据结构,并编写算法实现NFA到DFA的转化。-Write a program to read nfa.txt, the data structure constructed NFA and NFA to DFA write algorithm transformation
Platform: | Size: 174080 | Author: kangqingping | Hits:

[Data structsnfa

Description: 把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 determine into a DFA M ' , then the DFA M state minimization, given DFA M of finite state set S is divided into several disjoint subset, such that: any two different subset of the state are distinguishable, and the same subset of any two states are equivalent (to take advantage of Ia function, but does not need to construct ε-CLOSURE function, because This is a DFA). Output of the simplified DFA M ' .
Platform: | Size: 2048 | Author: 王静晓 | Hits:

[OtherNFA-to-DFA

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:

[Software EngineeringNFA-DFA

Description: 设计题目:把NFA确定化为DFA 的算法实现 设计内容及要求:构造一程序,实现:将给定的NFA M(其状态转换矩阵及初态、终态信息保存在指定文件中),确定化为DFA M’。(要先实现ε-CLOSURE函数和Ia函数)。输出DFA M’(其状态转换矩阵及初态、终态信息保存在指定文件中)。 -Design: the NFA into a DFA algorithm to determine the content and requirements of the design: structure a program to achieve: the given NFA M (its state transition matrix and the initial state, the final state information is saved in the specified file), determination of the the DFA M ' . (First to achieve ε-CLOSURE functions and Ia function). Output DFA M ' (its state transition matrix and the initial state, the final state information is saved in the specified file).
Platform: | Size: 111616 | Author: DZ | Hits:

[Linux-Unixcciss_ioctl

Description: Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags. -Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags.
Platform: | Size: 4096 | Author: hykiekq | Hits:

[Data structsDFA--TO--NFA--simpleDFA

Description: 程序实现的是编译原理中的NFA到DFA的转换(使用子集构造法)。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA
Platform: | Size: 3072 | Author: 张鹏飞 | Hits:

CodeBus www.codebus.net