Abstract Automata theory based on complete residuated lattice-valued logic has been
initiated by Qiu, and further systematically established by Qiu et al. In this paper, we propose …

The classical powerset construction is a standard method converting a non-deterministic
automaton into a deterministic one recognising the same language. Recently, the powerset …

We are motivated by the following question: which nominal languages admit an active
learning algorithm? This question was left open in previous work, and is particularly …

Deterministic automata can be minimized by partition refinement (Moore's algorithm,
Hopcroft's algorithm) or by reversal and determinization (Brzozowski's algorithm). In the …

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 …

Many methods for the verification of complex computer systems require the existence of a
tractable mathematical abstraction of the system, often in the form of an automaton. In reality …

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

The classical subset construction for non-deterministic automata can be generalized to other
side-effects captured by a monad. The key insight is that both the state space of the …

Several canonical forms of finite automata have been introduced over the decades. In
particular, if one considers the minimal deterministic finite automaton (DFA), the canonical …

It is well-known that every regular language admits a unique minimal deterministic acceptor.
Establishing an analogous result for non-deterministic acceptors is significantly more …