We study different behavioral metrics, such as those arising from both branching and linear-
time semantics, in a coalgebraic setting. Given a coalgebra α: X→ HX for a functor H: Set→ …

We propose a generic categorical framework for learning unknown formal languages of
various types (eg finite or infinite words, weighted and nominal languages). Our approach is …

We give a new presentation of Brzozowski's algorithm to minimize finite automata using
elementary facts from universal algebra and coalgebra and building on earlier work by Arbib …

In this paper we regard languages and their acceptors–such as deterministic or weighted
automata, transducers, or monoids–as functors from input categories that specify the type of …

Coalgebra offers a unified theory of state based systems, including infinite streams, labelled
transition systems and deterministic automata. In this paper, we use the coalgebraic view on …

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility
of the approach with concrete examples such as the language semantics of weighted …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

We show how to use duality theory to construct minimized versions of a wide class of
automata. We work out three cases in detail:(a variant of) ordinary automata, weighted …

Coalgebras in a Kleisli category yield a generic definition of trace semantics for various
types of labelled transition systems. In this paper we apply this generic theory to generative …

Coalgebra offers a general framework for modelling different types of state-based systems.
Our aim is to present generic algorithms to decide behavioural equivalence for coalgebras …