搜索资源列表
确定型状态机的最简化
- 计算理论的经典算法,将确定型有穷自动机最简化,根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.
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]
RE2DFA-(1)
- Converting Regular Expression to DFA Algorithm