Canonical automata via distributive law homomorphisms
From MaRDI portal
Publication:6653763
DOI10.4204/EPTCS.351.18MaRDI QIDQ6653763FDOQ6653763
Authors: Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, Alexandra Silva 
Publication date: 17 December 2024
Recommendations
Cites Work
- Learning regular sets from queries and counterexamples
- Universal coalgebra: A theory of systems
- Adjoint functors and triples
- A Coalgebraic Perspective on Minimization and Determinization
- Brzozowski's algorithm (co)algebraically
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Notions of computation and monads
- Combining a monad and a comonad
- Expressivity of coalgebraic modal logic: the limits and beyond
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trace semantics via determinization
- Theory of átomata
- Title not available (Why is that?)
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Linear Automaton Transformations
- Weak distributive laws
- Title not available (Why is that?)
- Coalgebraic constructions of canonical nondeterministic automata
- A recipe for state-and-effect triangles
- Generalizing determinization from automata to coalgebras
- Well-behaved translations between structural operational semantics
- Fuzzy machines in a category
- A coalgebraic approach to process equivalence and a coinduction principle for traces
- Trace semantics via determinization
- Presenting distributive laws
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning automata with side-effects
- Strong completeness for iteration-free coalgebraic dynamic logics
- A (co)algebraic theory of succinct automata
- Title not available (Why is that?)
- Bases as coalgebras
This page was built for publication: Canonical automata via distributive law homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653763)
