Search - nfa - CodeBus

Search - nfa - List

[Data structs] AutomTest DL : 0: NFA自动机的实验，可进行字符串的智能搜索-NFA automatic machine experiment can be carried out strings of Intelligent Search
Date : 2026-01-01 Size : 678kb User : luoqijun
[Data structs] NFASearcher DL : 0: NFA的字符串搜索的实例，带分析过程和中间处理信息-NFA search string of examples, with analysis and intermediate processing of information
Date : 2026-01-01 Size : 41kb User : luoqijun
[Data structs] NFtoDFA DL : 0: 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.
Date : 2026-01-01 Size : 273kb User : Y.A.M
[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 : 2026-01-01 Size : 4kb User : wushi86
[Data structs] shiyan2 DL : 0: 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum of DFA in this program used in the main data structure is an array, these arrays are used to store the initial NFA beginning of the state set, and the identification of and minimize the state after the matrix.
Date : 2026-01-01 Size : 392kb User : lihaixia
[Data structs] nfa DL : 0: 把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 ' .
Date : 2026-01-01 Size : 2kb User : 王静晓
[Data structs] subsetComput.rar DL : 0: 子集法实现NFA到DFA的转换，教学中给学生演示的。图用最简单的方法表示，非常便于理解。纯C代码，在windows和linux都可以编译运行,Subset of the NFA to DFA conversion, teaching to the student demonstration. Figure easiest way, very easy to understand. Pure C code can be compiled to run in windows and linux
Date : 2026-01-01 Size : 2kb User : 丁力
[Data structs] DFA--TO--NFA--simpleDFA DL : 0: 程序实现的是编译原理中的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
Date : 2026-01-01 Size : 3kb User : 张鹏飞
[Data structs] NFAtoDFA DL : 0: Compiler theory of the NFA is converted to an equivalent DFA C ++ program-Compiler theory of the NFA is converted to an equivalent DFA C++ program
Date : 2026-01-01 Size : 2kb User : peter