Logic and Program Semantics pp 12-23
Brzozowski’s Algorithm (Co)Algebraically
- Cite this paper as:
- Bonchi F., Bonsangue M.M., Rutten J.J.M.M., Silva A. (2012) Brzozowski’s Algorithm (Co)Algebraically. In: Constable R.L., Silva A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg
We give a new presentation of Brzozowski’s algorithm to minimize finite automata, using elementary facts from universal algebra and coalgebra, and building on earlier work by Arbib and Manes on the duality between reachability and observability. This leads to a simple proof of its correctness and opens the door to further generalizations.
Unable to display preview. Download preview PDF.