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 …

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 propose several heuristics for mitigating one of the main causes of combinatorial
explosion in rank-based complementation of Büchi automata (BAs): unnecessarily high …

This paper provides several optimizations of the rank-based approach for complementing
Büchi automata. We start with Schewe's theoretically optimal construction and develop a set …

We introduce an algorithmic framework to decide whether inclusion holds between
languages of infinite words over a finite alphabet. Our approach falls within the class of …

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

We present the tool Ranker for complementing Büchi automata (BAs). Ranker builds on our
previous optimizations of rank-based BA complementation and pushes them even further …

Abstract Families of DFAs (FDFAs) are a computational model recognizing ω-regular
languages. They were introduced in the quest of finding a Myhill-Nerode theorem for ω …

This paper provides several optimizations of the rank-based approach for complementing
B\"{u} chi automata. We start with Schewe's theoretically optimal construction and develop a …

We propose several heuristics for mitigating one of the main causes of combinatorial
explosion in rank-based complementation of B\"{u} chi automata (BAs): unnecessarily high …