Coalgebraic Minimization of Automata by Initiality and Finality - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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.

Dates and versions

hal-01487929 , version 1 (13-03-2017)

Identifiers

Cite

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⟩
183 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More