搜索资源列表
确定型状态机的最简化
- 计算理论的经典算法，将确定型有穷自动机最简化，根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.
zhengze
- 正则式到有穷自动机.VC++6.0环境下开发.-Is the type of the DFA. VC++6.0 development environment.
simulationofDFA
- source code for simulating a DFA in compilers
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]
dfa_main
- dfa anlaysis for time series
DFAaNFA
- 编译原理，判断一个字符串是否满足由DFA和NFA表示的正则表达式-Compiler theory, to determine whether a string meets represented by the DFA and NFA regex
RE2DFA-(1)
- Converting Regular Expression to DFA Algorithm
NFA-to-DFA-Conversion
- 分享一个NFA到对应的DFA的转换程序-Program to convert a given NFA to the corresponding DFA