Search

• < Previous
• 1
• Next >

---

Non-Deterministic Kleene Coalgebras

Alexandra Silva ; Marcello Bonsangue ; Jan Rutten.

In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and&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;]

---

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;]

---

Stream Differential Equations: Specification Formats and Solution Methods

Helle Hvid Hansen ; Clemens Kupke ; Jan Rutten.

Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been&nbsp;[&hellip;]

---