Search - nfa - CodeBus

Search - nfa - List

[Other] NFA到DFA DL : 0: 编译原理NFA到DFA的转换源码-compiler theory NFA to the DFA source conversion
Date : 2026-01-01 Size : 2kb User : 李余
[Other] NFA_DFA DL : 0: 这是一个编译原理中的一个技术，将已有的nfa转换为dfa的程序-This is a Compilation Principle of a technology, the NFA has been converted to DFA procedures
Date : 2026-01-01 Size : 1kb User : 合合
[Other] nfadfa DL : 0: 编译原理小作业NFA转DFA，用C写的，环境是VC下的控制台程序-Compiler Construction Principles small operating NFA to DFA, written using C, the environment is under VC console procedures
Date : 2026-01-01 Size : 8kb User : 徐元浩
[Other] nfa_dfa DL : 0: 输入一个正则表达式,输出相应的NFA图，NFA转换为DFA，将DFA最小化。-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA, the DFA minimization.
Date : 2026-01-01 Size : 168kb User : 彪
[Other] NFA DL : 0: NFA非确定型有穷自动机的相关功能不用修改，直接可用．-NFA Non-deterministic Finite Automata related functions need not be amended, can be used directly.
Date : 2026-01-01 Size : 1kb User : 秋峰
[Other] pl0 DL : 0: 正则表达式－＞NFA -Regular Expression-> NFA
Date : 2026-01-01 Size : 34kb User : liu
[Other] FA DL : 0: 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
Date : 2026-01-01 Size : 257kb User : 王据林
[Other] RegextoDFA DL : 0: 正则表达式转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 DFA 4DFA state transition table to determine whether to accept the input string, accompanied by detailed documentation.
Date : 2026-01-01 Size : 83kb User : 王乾坤
[Other] DFA_2 DL : 0: NFA转换为DFA，包括确定化和最小化。-NFA into DFA, including the identification of and minimized.
Date : 2026-01-01 Size : 544kb User : 邵其静
[Other] NFAtoDFA[J.S] DL : 0: 一个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.
Date : 2026-01-01 Size : 1.04mb User : 卓然
[Other] NFA_to_DFA211465612008 DL : 0: this program convert the nfa into dfa
Date : 2026-01-01 Size : 3kb User : jitendra
[Other] NFA2RegularExpression DL : 0: regular expression转换为NFA NFA转换到regular expression 包含设计说明文档、可执行程序、源代码等；清晰明了；用java编写；-regular expression into NFA NFA transition to regular expression Includes design documentation, executable programs, source code, etc. clarity Written with java
Date : 2026-01-01 Size : 898kb User : liu p
[Other] NFAtoDFA DL : 0: 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.
Date : 2026-01-01 Size : 802kb User : Behzad Solaymoney
[Other] NFA-to-DFA DL : 0: 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
Date : 2026-01-01 Size : 1kb User : Merwyn
[Other] nfa-dfa DL : 0: 编译原理实验将nfa到dfa编程实现可在vc 6.0中运行-Principle experiment is compiled nfa dfa programming to run in vc 6.0
Date : 2026-01-01 Size : 2kb User : ANGELO
[Other] nfa--dfa DL : 0: nfa转dfa,c++实现，转自lingyu940的csdn微博-nfa turn dfa, c++ achieve, carried lingyu940 of csdn microblogging
Date : 2026-01-01 Size : 2kb User : 焦鹏
[Other] 2 DL : 0: 实现NFA到DFA的转化,方便初学者使用体会(this is easy to understand)
Date : 2026-01-01 Size : 1kb User : 飞天螳螂
[Other] nfadfa DL : 0: nfa Drawing with graphic in c#
Date : 2026-01-01 Size : 56kb User : Roshani
[Other] NFA to DFA.cpp DL : 0: nfa转换为dfa，一个简单的程序cpp(nfa trans to dfa,a simple program. /.cpp)
Date : 2026-01-01 Size : 1kb User : 可以了
[Other] NFAtoDFA DL : 0: 将NFA转成DFA的程序，将不确定的自动机转化为确定的自动机，用于编译原理的研究。(Transforming NFA into DFA program, transforming uncertain automata into definite automata, is used for compiler principle research.)
Date : 2026-01-01 Size : 9kb User : 波波波司机

« 12 3 »