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 …

For each regular language L we describe a family of canonical nondeterministic acceptors
(nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally …

The syntactic monoid of a language is generalized to the level of a symmetric monoidal
closed category D. This allows for a uniform treatment of several notions of syntactic …

We introduce a new measure on regular languages: their nondeterministic syntactic
complexity. It is the least degree of any extension of the 'canonical boolean representation'of …

Nondeterministic automata may be viewed as succinct programs implementing deterministic
automata, ie complete specifications. Converting a given deterministic automaton into a …

This article contains a brief introduction to coalgebra and an overview of a recent proof of
correctness for Brzozowski's algorithm which uses coalgebraic techniques. In the discussion …

In this work, we define a framework of automata constructions based on quasiorders over
words to provide new insights on the class of residual automata. We present a new …