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 …

The work in this thesis has been carried out at the Centrum Wiskunde & Informatica, under
the auspices of the research school IPA (Institute for Programming research and …

Coalgebra is an abstract framework for the uniform study of different kinds of dynamical
systems. An endofunctor $ F $ determines both the type of systems ($ F $-coalgebras) and a …

Stream circuits are a convenient graphical way to represent streams (or stream functions)
computed by finite dimensional linear systems. We present a sound and complete …

Induction and coinduction are two complementary techniques used in mathematics and
computer science. These techniques occur together, for example, in control systems: On the …

As composites of constant, finite (co) product, identity, and powerset functors, Kripke
polynomial functors form a relevant class of Set Set-functors in the theory of coalgebras. The …

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 …

We present a systematic way to generate (1) languages of (generalised) regular
expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of …

Bloom and Ésik's concept of iteration theory summarises all equational properties that
iteration has in common applications, for example, in domain theory, where to every system …

Motivated by the need to reason about hybrid systems, we study limits in categories of
coalgebras whose underlying functor is a Vietoris polynomial one–intuitively, the topological …