Canonical automata via distributive law homomorphisms

DOI10.4204/eptcs.351.18MaRDI QIDQ6653763

Stefan Zetzsche, Alexandra Silva, Gerco van Heerdt, Matteo Sammartino

Publication date: 17 December 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Coalgebraic constructions of canonical nondeterministic automata
• Learning regular sets from queries and counterexamples
• Universal coalgebra: A theory of systems
• Combining a monad and a comonad
• Learning automata with side-effects
• Trace semantics via determinization
• A (co)algebraic theory of succinct automata
• Theory of átomata
• Expressivity of coalgebraic modal logic: the limits and beyond
• Adjoint functors and triples
• Well-behaved Translations between Structural Operational Semantics
• A Coalgebraic Perspective on Minimization and Determinization
• Brzozowski’s Algorithm (Co)Algebraically
• Trace Semantics via Determinization
• Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics
• Linear Automaton Transformations
• Fuzzy machines in a category
• Generalizing determinization from automata to coalgebras
• A Recipe for State-and-Effect Triangles
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• Bases as Coalgebras
• Presenting Distributive Laws

This page was built for publication: Canonical automata via distributive law homomorphisms