Location:
Search - minimum DFA
Search list
Description: 编译原理课程设计报告正规表达式到NFA（不确定的有限自动机），NFA到dfa及DFA（有限自动机）的最小-Principles of curriculum design report compiled formal expression to the NFA (finite automaton uncertain), NFA to DFA and the DFA (finite automaton) minimum
Platform: |
Size: 101376 |
Author: npc |
Hits:
Description: 本程序主要是使用“子集法”实现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.
Platform: |
Size: 401408 |
Author: lihaixia |
Hits:
Description: 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。
将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually construct a C language to identify all the typical words such as: identifiers, numbers, operators, and if, while the determination of reserved words such as finite automata, and write on the procedure should be automatic machine then a simplified C language program for the input file, through the design of automata based on the lexical analysis procedure for obtaining the input file and within each code word table, and save the results to file the form (that is, TOKEN sequence). Defining themselves in all the regular expression into NFA, and then consolidated for the NFA ' , then NFA' into a DFA, DFA then converted to a minimum state DFA ' , the last by the DFA' into a lexical analysis program.
Platform: |
Size: 337920 |
Author: 罗丹 |
Hits:
Description: 编译原理中的DFA最小化实现方法，用C语言实现-DFA Compilation Principle of minimum realization method, using C language
Platform: |
Size: 3072 |
Author: GoDong |
Hits:
Description: 编译原理文法C语言编程实现DFA的最小化-C programming language grammar compiler theory to achieve the minimum DFA
Platform: |
Size: 1024 |
Author: hudong |
Hits:
Description: 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
Platform: |
Size: 2048 |
Author: dai |
Hits:
Description: 按照输入提示输入一个NFA，可以得到一个最小的DFA-After entering an NFA with the input instruction,a minimum DFA can be figured out.
Platform: |
Size: 87040 |
Author: q |
Hits:
Description: Java实现有限自动机相关功能的工具包，包含：正则式与NFA,DFA的相互转化；DFA的交、并、差、补运算；判断一个DFA对应的正则集是否是无限集；列出一个有限正则集所包含的所有字符串，以及包含字符串的最小长度和最大长度；判断两个最小化DFA是否等价等。
代码已开源：https://a1e2w3@bitbucket.org/a1e2w3/dfa4java.git-Java implementation of finite automata related functions toolkit includes: transformation between regular expression, NFA and DFA. The intersect, complement, substract and union operation of DFA. Judge whether the corresponding regular sets of a DFA is an infinite set. Lists all the strings contain in a finite regular set, and calculate the minimum and maximum length of the strings contains. Determine whether the two minimized DFA equivalence or not, and so on.
Code is open source: https://a1e2w3 @ bitbucket.org/a1e2w3/dfa4java.git
Platform: |
Size: 141312 |
Author: 王聪 |
Hits:
Description: C#实现最小DFA算法。化简DFA为最小化的DFA。图形介面。-C# implementation of the minimum DFA algorithm. Simplified DFA for the minimization of the DFA. Graphics interface.
Platform: |
Size: 71680 |
Author: 李萌萌 |
Hits: