Search - convert nfa to dfa

Search - convert nfa to dfa - List

[Other] NFA到DFA DL : 0: 编译原理NFA到DFA的转换源码-compiler theory NFA to the DFA source conversion
Date : 2025-07-16 Size : 2kb User : 李余
[Data structs] NFtoDFA DL : 0: 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.
Date : 2025-07-16 Size : 273kb User : Y.A.M
[ELanguage] DFA DL : 0: 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。-Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
Date : 2025-07-16 Size : 1.48mb User : 刘琳
[ELanguage] NFA DL : 0: 实现NFA到DFA的转换EVMSG_INSTALLED 0x00000064L-convert NFA to DFA
Date : 2025-07-16 Size : 3kb User : chenhuiyu
[Data structs] compile_work2 DL : 0: 自动机的确定化，充分理解和掌握NFA、DFA以及NFA确定化过程的相关概念和知识，编程实现对输入NFA转换成DFA输出的功能。-Determination of automata, and fully understand and master the NFA, DFA and NFA to determine the relevance of the concept of process and knowledge of programming to convert NFA to DFA input output function.
Date : 2025-07-16 Size : 4kb User : wushi86
[Other] Determinis1747915202004 DL : 0: Uploading, This program use to convert nfa to dfa.
Date : 2025-07-16 Size : 19kb User : Pham Thien Truong
[Algorithm] Finite_Aut2127819222008 DL : 0: 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]
Date : 2025-07-16 Size : 44kb User : csp
[Other] NFA_to_DFA211465612008 DL : 0: this program convert the nfa into dfa
Date : 2025-07-16 Size : 3kb User : jitendra
[JSP/Java] 22nfa2dfa DL : 0: nfa convert to dfa by java language
Date : 2025-07-16 Size : 296kb User : Zicker
[.net] fileloading DL : 0: convert nfa to dfa this program neveshte shode dar c++ builder
Date : 2025-07-16 Size : 380kb User : moein
[.net] A_N_-_Quee18114710282004 DL : 0: convert nfa to dfa this program neveshte shode dar c++ builder
Date : 2025-07-16 Size : 1kb User : moein
[ELanguage] objectorientedDFA DL : 0: enter user a nfa and convert nfa to dfa
Date : 2025-07-16 Size : 1.16mb User : barfoyakh
[FlashMX] jflex-1.4.3.tar DL : 0: jflex-1.4.3 new opensource java flex project to convert NFA to DFA-jflex-1.4.3 new opensource java flex project to convert NFA to DFA
Date : 2025-07-16 Size : 1.16mb User : Java_Tun
[ELanguage] NFA-CONVERT-TO-DFA DL : 0: 编写程序读取nfa.txt，构造出NFA的数据结构，并编写算法实现NFA到DFA的转化。-Write a program to read nfa.txt, the data structure constructed NFA and NFA to DFA write algorithm transformation
Date : 2025-07-16 Size : 170kb User : kangqingping
[ELanguage] NFAtoDFA DL : 0: 内容：自动机编程，NFA转换DFA程序，将输入的NFA转换为DFA-Content: automatic machine programming, NFA DFA conversion procedure to convert the input of the NFA to DFA
Date : 2025-07-16 Size : 45kb User : tong
[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 : 2025-07-16 Size : 1kb User : Merwyn
[VC/MFC] lexical-analysis DL : 0: 这是一个词法分析程序，可实现nfa到dfa的转换，以及dfa的化简-This is a lexical analysis program can convert nfa to dfa, dfa of simplification
Date : 2025-07-16 Size : 182kb User : yuchen
[ELanguage] nfa DL : 0: this program will convert ndfa to dfa
Date : 2025-07-16 Size : 1kb User : sumit
[ELanguage] AA DL : 0: c program to convert NFA to DFA
Date : 2025-07-16 Size : 1kb User : khan
[Algorithm] NFA-to-DFA-Conversion DL : 0: 分享一个NFA到对应的DFA的转换程序-Program to convert a given NFA to the corresponding DFA
Date : 2025-07-16 Size : 2kb User : Remon

« 12 »