Algebra-coalgebra duality in brzozowski's minimization algorithm
From MaRDI portal
Publication:5410330
DOI10.1145/2490818zbMath1288.68174OpenAlexW2138769606MaRDI QIDQ5410330
Helle Hvid Hansen, Prakash Panangaden, Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten
Publication date: 16 April 2014
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/34733
Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70)
Related Items (23)
Varieties and covarieties of languages (extended abstract) ⋮ On continuous nondeterminism and state minimality ⋮ Minimality Notions via Factorization Systems and Examples ⋮ Concurrent Kleene algebra with tests and branching automata ⋮ Regular Varieties of Automata and Coequations ⋮ Equations and Coequations for Weighted Automata ⋮ Behavioural equivalences for coalgebras with unobservable moves ⋮ Singular value automata and approximate minimization ⋮ Coalgebraic trace semantics via forgetful logics ⋮ The dual equivalence of equations and coequations for automata ⋮ Coalgebraic minimization of automata by initiality and finality ⋮ Promise problems solved by quantum and classical finite automata ⋮ Unnamed Item ⋮ Automata Learning: A Categorical Perspective ⋮ Languages and models for hybrid automata: a coalgebraic perspective ⋮ Weighted automata are compact and actively learnable ⋮ Quantitative simulations by matrices ⋮ Unnamed Item ⋮ Stone duality, topological algebra, and recognition. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Bisimulation metrics and norms for real-weighted automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A coalgebraic perspective on linear weighted automata
- Foundations of software science and computational structures. 15th international conference, FOSSACS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 -- April 1, 2012. Proceedings
- On the postulates for lattices
- Local variable scoping and Kleene algebra with tests
- Machines in a category
- Foundations of system theory: The Hankel matrix
- Adjoint machines, state-behavior machines, and duality
- Universal coalgebra: A theory of systems
- On the relevance of abstract algebra to control theory
- Stone Duality and the Recognisable Languages over an Algebra
- A Coalgebraic Perspective on Minimization and Determinization
- Well-Pointed Coalgebras (Extended Abstract)
- Brzozowski’s Algorithm (Co)Algebraically
- Minimization via Duality
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Projections on Invariant Subspaces
- A Bialgebraic Approach to Automata and Formal Language Theory
- Fuzzy machines in a category
- Extensions of Semilattices
- Minimal realization of machines in closed categories
- Machines in a Category: An Expository Introduction
- Nondeterministic Moore Automata and Brzozowski’s Algorithm
- Experimental Evaluation of Classical Automata Constructions
- Probabilistic automata
This page was built for publication: Algebra-coalgebra duality in brzozowski's minimization algorithm
