Brzozowski's Algorithm (Co)Algebraically. - Archive ouverte HAL
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2012

Brzozowski's Algorithm (Co)Algebraically.

Résumé

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.
Fichier non déposé

Dates et versions

hal-00798062 , version 1 (07-03-2013)

Identifiants

  • HAL Id : hal-00798062 , version 1

Citer

Filippo Bonchi, Marcello Bonsangue, Jan Rutten, Alexandra Silva. Brzozowski's Algorithm (Co)Algebraically.. Logic and Program Semantics: 60 Birthday Dexter Kozen, 2012, United States. pp.12-23. ⟨hal-00798062⟩
72 Consultations
0 Téléchargements

Partager

More