搜索资源列表
shiyan2
- 本程序主要是使用“子集法”实现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
Finite_Aut2127819222008
- 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]
NFA_To_DFA
- This Program will convert the Non-Deterministic Finite Automata to Deterministic Finite Automata. Here RE is not given but NFA-Table should be given to the Input And output will FA-Table. So best of luck-This Program will convert the Non-De
NFAtoDFA
- 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
NFA-to-DFA-Conversion
- 分享一个NFA到对应的DFA的转换程序-Program to convert a given NFA to the corresponding DFA