Coalgebraic minimization of automata by initiality and finality

DOI10.1016/j.entcs.2016.09.042zbMath1401.68217OpenAlexW2528624809WikidataQ113317630 ScholiaQ113317630MaRDI QIDQ1744392

Jurriaan Rot

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.042

zbMATH Keywords

coalgebraautomataminimization

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (2)

Minimality Notions via Factorization Systems and Examples ⋮ Steps and traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coalgebraic semantics of modal logics: an overview
• Coalgebraic constructions of canonical nondeterministic automata
• Structural induction and coinduction in a fibrational setting
• Universal coalgebra: A theory of systems
• Trace semantics via determinization
• DFA minimization: double reversal versus split minimization algorithms
• A Coalgebraic Perspective on Minimization and Determinization
• Brzozowski’s Algorithm (Co)Algebraically
• Minimization via Duality
• Coalgebraic Trace Semantics via Forgetful Logics
• Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
• Coalgebraic Modal Logic Beyond Sets
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• Duality of Equations and Coequations via Contravariant Adjunctions

This page was built for publication: Coalgebraic minimization of automata by initiality and finality