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 …

The paper explains the connection between topological theories for one-manifolds with
defects and values in the Boolean semiring and automata and their generalizations. Finite …

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 …

This paper is devoted to the study of nondeterministic closure automata, that is,
nondeterministic finite automata (nfas) equipped with a strict closure operator on the set of …

Residual finite state automata (RFSA) are a subclass of nondeterministic finite automata with
the property that every state of an RFSA defines a residual language (a left quotient) of the …

We introduce the category of dependency automata. A dependency automaton consists of
two nondeterministic finite automata, with a relation between their states satisfying …

For each language L⊆\textbf2^* and function t: ℕ→ ℕ, we define another language
t∗L⊆\textbf2^*. We then prove that L∈ NL/poly if and only if there exists k∈ ℕ such that the …