A Coalgebraic Perspective on Minimization and Determinization

DOI10.1007/978-3-642-28729-9_4zbMath1352.68171OpenAlexW2157657301MaRDI QIDQ2892759

Jiří Adámek, Alexandra Silva, Stefan Milius, Filippo Bonchi, Mathias Hülsbusch, Barbara König

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28729-9_4

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Abstract data types; algebraic specification (68Q65) Categories of machines, automata (18B20)

Related Items (19)

Coinductive predicates and final sequences in a fibration ⋮ Bisimilarity of Diagrams ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ A coalgebraic semantics for causality in Petri nets ⋮ A (co)algebraic theory of succinct automata ⋮ Unnamed Item ⋮ Coalgebraic trace semantics via forgetful logics ⋮ A description based on languages of the final non-deterministic automaton ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ Algebra-coalgebra duality in brzozowski's minimization algorithm ⋮ Revisiting causality, coalgebraically ⋮ Languages and models for hybrid automata: a coalgebraic perspective ⋮ Quantitative simulations by matrices ⋮ A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata ⋮ Unnamed Item ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Coinductive predicates and final sequences in a fibration ⋮ Unnamed Item ⋮ Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic

This page was built for publication: A Coalgebraic Perspective on Minimization and Determinization