Minimality Notions via Factorization Systems and Examples
From MaRDI portal
Publication:5043590
DOI10.46298/lmcs-18(3:31)2022OpenAlexW4214799023MaRDI QIDQ5043590
Publication date: 6 October 2022
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.05701
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Structural operational semantics for stochastic and weighted transition systems
- A hierarchy of probabilistic system types
- On minimal coalgebras
- Optimal state-space lumping in Markov chains
- Universal coalgebra: A theory of systems
- Coalgebraic minimization of automata by initiality and finality
- An efficient algorithm for computing bisimulation equivalence
- Coalgebra learning via duality
- Path category for free. Open morphisms from coalgebras with non-deterministic branching
- A new foundation for finitary corecursion and iterative algebras
- Types and coalgebraic structure
- Introduction to Coalgebra
- Well-Pointed Coalgebras
- Nominal Coalgebraic Data Types with Applications to Lambda Calculus
- Minimization via Duality
- Finitary Functors: From Set to Preord and Poset
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Simple O(m logn) Time Markov Chain Lumping
- Bisimilarity Minimization in O(m logn) Time
- Three Partition Refinement Algorithms
- Monoid-labeled transition systems
- Minimality Notions via Factorization Systems and Examples
- A final coalgebra theorem
- Efficient Coalgebraic Partition Refinement
- A coalgebraic view on reachability
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Bisimulation by Partitioning Is Ω((m+n)log n).
