%0 Book
%B Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday
%D 2012
%T Brzozowski's Algorithm (Co)Algebraically
%A Filippo Bonchi
%A Marcello Bonsangue
%A Jan Rutten
%A Alexandra Silva
%C Ithaca, NY
%I Lecture Notes in Computer Science
%P 12–23
%S Lecture Notes in Computer Science
%U http://link.springer.com/chapter/10.1007%2F978-3-642-29485-3_2
%V 7230
%X <p>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.</p>