Algebra-coalgebra duality in Brzozowski's minimization algorithm
From MaRDI portal
Recommendations
Cites work
- A Bialgebraic Approach to Automata and Formal Language Theory
- A coalgebraic perspective on linear weighted automata
- A Coalgebraic Perspective on Minimization and Determinization
- Adjoint machines, state-behavior machines, and duality
- Brzozowski's algorithm (co)algebraically
- Elements of automata theory. Translated from the French by Reuben Thomas
- Experimental Evaluation of Classical Automata Constructions
- Extensions of Semilattices
- 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. Proceedi
- Foundations of system theory: The Hankel matrix
- Fuzzy machines in a category
- Generalizing the powerset construction, coalgebraically
- scientific article; zbMATH DE number 1705159 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1773093 (Why is no real title available?)
- scientific article; zbMATH DE number 3365976 (Why is no real title available?)
- Local variable scoping and Kleene algebra with tests
- Machines in a category
- Machines in a Category: An Expository Introduction
- Minimal realization of machines in closed categories
- Minimization via duality
- Nondeterministic Moore automata and Brzozowski's algorithm
- On the postulates for lattices
- On the relevance of abstract algebra to control theory
- Probabilistic automata
- Projections on Invariant Subspaces
- Sound and complete axiomatizations of coalgebraic language equivalence
- Stone duality and the recognisable languages over an algebra
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Universal coalgebra: A theory of systems
- Well-pointed coalgebras (extended abstract)
Cited in
(32)- Coalgebraic minimization of automata by initiality and finality
- Languages and models for hybrid automata: a coalgebraic perspective
- Weighted automata are compact and actively learnable
- Bisimulation metrics and norms for real-weighted automata
- Varieties and covarieties of languages (extended abstract)
- On continuous nondeterminism and state minimality
- A Coalgebraic Perspective on Minimization and Determinization
- Brzozowski's algorithm (co)algebraically
- Minimization via duality
- Regular varieties of automata and coequations
- Equations and coequations for weighted automata
- Coalgebraic trace semantics via forgetful logics
- Concurrent Kleene algebra with tests and branching automata
- Behavioural equivalences for timed systems
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- The dual equivalence of equations and coequations for automata
- Minimality Notions via Factorization Systems and Examples
- A congruence-based perspective on automata minimization algorithms
- scientific article; zbMATH DE number 7577568 (Why is no real title available?)
- Singular value automata and approximate minimization
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Promise problems solved by quantum and classical finite automata
- scientific article; zbMATH DE number 7204386 (Why is no real title available?)
- Nondeterministic Moore automata and Brzozowski's algorithm
- Automata Learning: A Categorical Perspective
- Stone duality, topological algebra, and recognition.
- Minimisation in logical form
- Canonical automata via distributive law homomorphisms
- Dual adjunction between -automata and Wilke algebra quotients
- Optimal approximate minimization of one-letter weighted finite automata
- Quantitative simulations by matrices
- Behavioural equivalences for coalgebras with unobservable moves
This page was built for publication: Algebra-coalgebra duality in Brzozowski's minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410330)
