Brzozowski's algorithm (co)algebraically

We give a new presentation of Brzozowski's algorithm to minimize nite 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.