Brzozowski's determinization algorithm (co)algebraically
---------------------------------------------------------

In this talk I will give a new presentation of Brzozowski's
algorithm for minimizing  finite automata, using Arbib and Manes
duality  between reachability and observability  This leads to a
simple proof of its correctness and opens the door to further
generalizations, such as Moore and weighted automata.