Three partition refinement algorithms
SIAM Journal on Computing
Re-describing an algorithm by Hopcroft
Theoretical Computer Science
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
Bisimilarity Minimization in O(m logn) Time
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Simple Bisimilarity Minimization in O(m log n) Time
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2009
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.89 |
Minimization of deterministic finite automata has traditionally required complicated programs and correctness proofs, and taken O(nklogn) time, where n is the number of states and k the size of the alphabet. Here a short, memory-efficient program is presented that runs in O(n+mlogm), or even in O(n+mlogn), time, where m is the number of transitions. The program is complete with input, output, and the removal of irrelevant parts of the automaton. Its invariant-style correctness proof is relatively short.