Brzozowski's algorithm (co)algebraically
From MaRDI portal
Recommendations
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
- Coalgebraic minimization of automata by initiality and finality
- Varieties and covarieties of languages (extended abstract)
- Brzozowski algorithm is generically super-polynomial for deterministic automata
Cited in
(14)- Coalgebraic minimization of automata by initiality and finality
- Varieties and covarieties of languages (extended abstract)
- A CONCURRENT SPECIFICATION OF BRZOZOWSKI'S DFA CONSTRUCTION ALGORITHM
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- \textsf{LCC}-program transformers through Brzozowski's equations
- The dual equivalence of equations and coequations for automata
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Automata Learning: A Categorical Perspective
- Canonical automata via distributive law homomorphisms
- Brzozowski's algorithm for automata minimization verified in Coq
- Optimal approximate minimization of one-letter weighted finite automata
- Coalgebraic constructions of canonical nondeterministic automata
This page was built for publication: Brzozowski's algorithm (co)algebraically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897941)