Minimality Notions via Factorization Systems and Examples

DOI10.46298/LMCS-18(3:31)2022OpenAlexW4214799023MaRDI QIDQ5043590FDOQ5043590

Authors: Thorsten Wißmann 

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

Recommendations

• A Coalgebraic Perspective on Minimization and Determinization
• Coalgebraic minimization of automata by initiality and finality
• scientific article; zbMATH DE number 177514
• scientific article; zbMATH DE number 177239
• On minimal coalgebras

zbMATH Keywords

minimizationobservabilityreachabilitycoalgebrafactorization system

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Universal coalgebra: A theory of systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebra-coalgebra duality in Brzozowski's minimization algorithm
• Three Partition Refinement Algorithms
• A final coalgebra theorem
• Optimal state-space lumping in Markov chains
• Simple \(O(m \log n)\) time Markov chain lumping
• Title not available (Why is that?)
• Nominal coalgebraic data types with applications to lambda calculus
• Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Types and coalgebraic structure
• Structural operational semantics for stochastic and weighted transition systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monoid-labeled transition systems
• A hierarchy of probabilistic system types
• An efficient algorithm for computing bisimulation equivalence
• Bisimilarity Minimization in O(m logn) Time
• Minimization via duality
• Finitary Functors: From Set to Preord and Poset
• Title not available (Why is that?)
• On minimal coalgebras
• Generic trace theory
• Title not available (Why is that?)
• Efficient Coalgebraic Partition Refinement
• Well-pointed coalgebras
• Introduction to coalgebra. Towards mathematics of states and observation
• Bisimulation by Partitioning Is Ω((m+n)log n).
• Coalgebraic minimization of automata by initiality and finality
• Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
• A new foundation for finitary corecursion and iterative algebras
• Efficient and modular coalgebraic partition refinement
• Coalgebra learning via duality
• Path category for free. Open morphisms from coalgebras with non-deterministic branching
• A coalgebraic view on reachability
• Minimality Notions via Factorization Systems and Examples
• Title not available (Why is that?)

Cited In (5)

• Quasifactors of minimal systems
• Minimality Notions via Factorization Systems and Examples
• Minimal resultant systems
• Title not available (Why is that?)
• Title not available (Why is that?)

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)