Generalizing the powerset construction, coalgebraically
From MaRDI portal
Recommendations
- Generalizing determinization from automata to coalgebras
- Coalgebraic Automata Theory: Basic Results
- Lifting adjunctions to coalgebras to (re)discover automata constructions
- Sound and complete axiomatizations of coalgebraic language equivalence
- A Coalgebraic Perspective on Minimization and Determinization
Cited in
(32)- The powerset operator on abstract interpretations
- Bialgebraic foundations for the operational semantics of string diagrams
- Corecursion up-to via causal transformations
- Bisimulation and coinduction enhancements: a historical perspective
- Trace semantics via determinization
- Context-free coalgebras
- A (co)algebraic theory of succinct automata
- Lifting adjunctions to coalgebras to (re)discover automata constructions
- Sound and complete axiomatizations of coalgebraic language equivalence
- Companions, codensity and causality
- Final semantics for decorated traces
- Powerset Residuated Algebras and Generalized Lambek Calculus
- Termination in convex sets of distributions
- Generalizing determinization from automata to coalgebras
- scientific article; zbMATH DE number 1420879 (Why is no real title available?)
- scientific article; zbMATH DE number 7471716 (Why is no real title available?)
- The theory of traces for systems with nondeterminism, probability, and termination
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Distribution bisimilarity via the power of convex algebras
- A general account of coinduction up-to
- Simplified coalgebraic trace equivalence
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Initial algebras of terms with binding and algebraic structure
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Product rules and distributive laws
- Minimisation in logical form
- Graded semantics and graded logics for Eilenberg-Moore coalgebras
- Weakening and iterating laws using string diagrams
- Towards the critical problem: On the coalgebraic relation between sets and multisets
- Expressive quantale-valued logics for coalgebras: an adjunction-based approach
- A completeness theorem for probabilistic regular expressions
- Strong induction is an up-to technique
This page was built for publication: Generalizing the powerset construction, coalgebraically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908856)
