Location:
Search - dfa simplify
Search list
Description: 简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)，设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价，记为p≡q。而且，≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态-Simplify the DFA-for a defined automaton M = (K, Σ, Δ, s, F), set p, q ∈ K, if for any string w, from p along w up to a certain destination if and only if along w from q up to a certain destination, then that p, q equivalent is recorded as p ≡ q. Moreover, ≡ an equivalence class is just the least number of states determine the type of a state automaton
Platform: |
Size: 8192 |
Author: David |
Hits:
Description: 可以实现NFA到DFA的转换，还可以化简DFA。程序很清晰，详细。-NFA to DFA can achieve the conversion, you can also simplify DFA. Procedures are clear and detailed.
Platform: |
Size: 2048 |
Author: 火麒麟 |
Hits:
Description: 程序实现的是编译原理中的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
Platform: |
Size: 3072 |
Author: 张鹏飞 |
Hits: