Skip to Main content Skip to Navigation
New interface
Conference papers

Coalgebraic Minimization of Automata by Initiality and Finality

Abstract : Deterministic automata can be minimized by partition refinement (Moore's algorithm, Hopcroft's algorithm) or by reversal and determinization (Brzozowski's algorithm). In the coalgebraic perspective, the first approach can be phrased in terms of a minimization construction along the final sequence of a functor, whereas a crucial part of the second approach is based on a reachability construction along the initial sequence of another functor. We employ this coalgebraic perspective to establish a precise relationship between the two approaches to minimization, and show how they can be combined. Part of these results are extended to an approach for language equivalence of a general class of systems with branching, such as non-deterministic automata.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01487929
Contributor : Jurriaan Rot Connect in order to contact the contributor
Submitted on : Monday, March 13, 2017 - 11:34:40 AM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM

Links full text

Identifiers

Citation

Jurriaan Rot. Coalgebraic Minimization of Automata by Initiality and Finality. Thirty-second Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXII), May 2016, Pittsburgh, United States. pp.253--276, ⟨10.1016/j.entcs.2016.09.042⟩. ⟨hal-01487929⟩

Share

Metrics

Record views

184