There are various types of automata on infinite words, differing in their acceptance
conditions. The most classic ones are weak, Büchi, co-Büchi, parity, Rabin, Streett, and …

About 25 years ago, it came to light that a single combinatorial property determines both an
important dividing line in model theory (NIP) and machine learning (PAC-learnability). The …

In 1987 Angluin proposed an algorithm, termed L⁎ for inferring an unknown regular
language using membership and equivalence queries. This algorithm has found many …

In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …

We present a polynomial time algorithm that constructs a deterministic parity automaton
(DPA) from a given set of positive and negative ultimately periodic example words. We show …

We propose a novel algorithm to decide the language inclusion between (nondeterministic)
Büchi automata, a PSpace-complete problem. Our approach, like others before, leverage a …

We present an algorithm that constructs a deterministic Büchi automaton in polynomial time
from given sets of positive and negative example words. This learner constructs multiple …

We propose a new framework for active learning of deterministic infinite-words automata. In
our framework, the teacher answers standard membership and equivalence queries, and …

We introduce new combinatorial quantities for concept classes, and prove lower and upper
bounds for learning complexity in several models of learning in terms of various …

Abstract Families of DFAs (FDFAs) have recently been introduced as a new representation
of ω-regular languages. They target ultimately periodic words, with acceptors revolving …