Brzozowski’s Algorithm (Co)Algebraically

  • Filippo Bonchi
  • Marcello M. Bonsangue
  • Jan J. M. M. Rutten
  • Alexandra Silva
Conference paper

DOI: 10.1007/978-3-642-29485-3_2

Volume 7230 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Filippo Bonchi
    • 1
  • Marcello M. Bonsangue
    • 2
    • 3
  • Jan J. M. M. Rutten
    • 3
    • 4
  • Alexandra Silva
    • 3
    • 4
    • 5
  1. 1.CNRS, ENS LyonUniversité de Lyon LIP (UMR 5668)France
  2. 2.LIACSLeiden UniversityThe Netherlands
  3. 3.Radboud University NijmegenThe Netherlands
  4. 4.Centrum Wiskunde & InformaticaThe Netherlands
  5. 5.HASLab / INESC TECUniversidade do MinhoPortugal