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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adámek, J., Milius, S., Moss, L.S., Sousa, L.: Well-pointed Coalgebras (Unpublished note)
Arbib, M.A., Manes, E.G.: Adjoint machines, state-behaviour machines, and duality. Journal of Pure and Applied Algebra 6, 313–344 (1975)
Arbib, M.A., Manes, E.G.: Machines in a category. Journal of Pure and Applied Algebra 19, 9–20 (1980)
Bidoit, M., Hennicker, R., Kurz, A.: On the Duality between Observability and Reachability. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 72–87. Springer, Heidelberg (2001)
Bezhanishvili, N., Panangaden, P., Kupke, C.: Minimization via duality (Unpublished note)
Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata 12(6), 529–561 (1962)
Castiglione, G., Restivo, A., Sciortino, M.: Nondeterministic Moore Automata and Brzozowski’s Algorithm. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 88–99. Springer, Heidelberg (2011)
Kozen, D.: Automata and Computability. Springer, Heidelberg (1997)
Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19, 427–443 (1997)
Hundt, C., Panangaden, P., Pineau, J., Precup, D., Dinculescu, M.: The duality of state and observations (Unpublished note)
Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230–245 (1963)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000); Fundamental Study
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4(2-3), 245–270 (1961)
Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing the powerset construction, coalgebraically. In: Proc. of FSTTCS 2010. Leibniz International Proceedings in Informatics (LIPIcs) Series, vol. 8, pp. 272–283 (2010)
Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D thesis, Eindhoven University of Technology, The Netherlands (1995)
Watson, B.W.: Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 311–317. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
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. https://doi.org/10.1007/978-3-642-29485-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-29485-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29484-6
Online ISBN: 978-3-642-29485-3
eBook Packages: Computer ScienceComputer Science (R0)