Minimality Notions via Factorization Systems and Examples
From MaRDI portal
Recommendations
Cites work
- A coalgebraic view on reachability
- A final coalgebra theorem
- A hierarchy of probabilistic system types
- A new foundation for finitary corecursion and iterative algebras
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- An efficient algorithm for computing bisimulation equivalence
- Bisimilarity Minimization in O(m logn) Time
- Bisimulation by Partitioning Is Ω((m+n)log n).
- Coalgebra learning via duality
- Coalgebraic minimization of automata by initiality and finality
- Efficient and modular coalgebraic partition refinement
- Efficient Coalgebraic Partition Refinement
- Finitary Functors: From Set to Preord and Poset
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Generic trace theory
- scientific article; zbMATH DE number 1705159 (Why is no real title available?)
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 1971280 (Why is no real title available?)
- scientific article; zbMATH DE number 1753205 (Why is no real title available?)
- scientific article; zbMATH DE number 2172972 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 3367098 (Why is no real title available?)
- scientific article; zbMATH DE number 7774250 (Why is no real title available?)
- Introduction to coalgebra. Towards mathematics of states and observation
- Minimality Notions via Factorization Systems and Examples
- Minimization via duality
- Monoid-labeled transition systems
- Nominal coalgebraic data types with applications to lambda calculus
- On minimal coalgebras
- Optimal state-space lumping in Markov chains
- Path category for free. Open morphisms from coalgebras with non-deterministic branching
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Simple O(m n) time Markov chain lumping
- Structural operational semantics for stochastic and weighted transition systems
- Three Partition Refinement Algorithms
- Types and coalgebraic structure
- Universal coalgebra: A theory of systems
- Well-pointed coalgebras
Cited in
(5)
This page was built for publication: Minimality Notions via Factorization Systems and Examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043590)