activity
20082016
most citedGeneralizing determinization from automata to coalgebras

111 citations · 169 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LO2016★ 13 cited

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 dif…

cs.LO2013★ 20 cited

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 algebr…

cs.LO2013

Automatic Equivalence Proofs for Non-deterministic Coalgebras

Marcello Bonsangue, Georgiana Caltais, Eugen-Ioan Goriac +3

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a…

cs.LO2013★ 111 cited

Generalizing determinization from automata to coalgebras

Alexandra Silva, Filippo Bonchi, Marcello Bonsangue +1

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 powers…

cs.LO2010★ 11 cited

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…

cs.LO2008★ 14 cited

Rational streams coalgebraically

J. J. M. M. Rutten

We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalenc…