Search

• < Previous
• 1
• Next >

---

Generalizing determinization from automata to coalgebras

Alexandra Silva ; Filippo Bonchi ; Marcello Bonsangue ; Jan Rutten.

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an&nbsp;[&hellip;]

---

Presenting Distributive Laws

Marcello M. Bonsangue ; Helle Hvid Hansen ; Alexander Kurz ; Jurriaan Rot.

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for&nbsp;[&hellip;]

---

Coalgebraic Characterizations of Context-Free Languages

Joost Winter ; Jan J. M. Rutten ; Marcello M. Bonsangue.

In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying output-derivative pairs. Final coalgebra semantics then gives an interpretation function&nbsp;[&hellip;]

---