Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

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

Monadic second-order logic of one successor (S1S) is a logic for specifying ω ω-regular
languages in a concise way. In this paper, we revisit the classical decision procedure based …

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 …

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 …

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

We introduce an algorithmic framework to decide the language inclusion for languages of
infinite words. We define algorithms for different decidable cases like the inclusion between …

In this thesis, we investigate the decidability of some first-order theories. Let S be a finite or
recursively enumerable set of relation and function symbols, which we also call signature. 1 …