<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Filippo Bonchi</style></author><author><style face="normal" font="default" size="100%">Marcello Bonsangue</style></author><author><style face="normal" font="default" size="100%">Jan Rutten</style></author><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Brzozowski's Algorithm (Co)Algebraically</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Program Semantics - Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/chapter/10.1007%2F978-3-642-29485-3_2</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></publisher><pub-location><style face="normal" font="default" size="100%">Ithaca, NY</style></pub-location><volume><style face="normal" font="default" size="100%">7230</style></volume><pages><style face="normal" font="default" size="100%">12–23</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>