Given a formula phi (x, X) positive in X, the bounded ness problem asks whether the fix point
induced by phi is reached within some uniform bound independent of the structure (ie …

We study the boundedness problem for unions of conjunctive regular path queries with
inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is …

We study alternating parity good-for-games (GFG) automata, ie, alternating parity automata
where both conjunctive and disjunctive choices can be resolved in an online manner …

Weakly definable languages of infinite trees are an expressive subclass of regular tree
languages definable in terms of weak monadic second-order logic, or equivalently weak …

L'objet de cette thèse est l'étude des fonctions régulières de coût. Il s' agit d'une extension
quantitative de la notion, classique, de langages réguliers, qui en préserve certaines …

In this work we prove decidability of the model-checking problem for safe recursion schemes
against properties defined by alternating B-automata. We then exploit this result to show …

For a given regular language of infinite trees, one can ask about the minimal number of
priorities needed to recognise this language with a non-deterministic or alternating parity …

We study the topological complexity of languages of Büchi automata on infinite binary trees.
We show that such a language is either Borel and WMSO-definable, or Σ 1 1-complete and …

The book is based on the PhD thesis “Descriptive Set Theoretic Methods in Automata
Theory,” awarded the EW Beth Prize in 2015 for outstanding dissertations in the fields of …

Regular cost functions provide a quantitative extension of regular languages that retains
most of their important properties, such as expressive power and decidability, at least over …