Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis. - Gaëtan Douéneau-Tabot; Sophie Pinchinat; François Schwarzentruber (Advances in Modal Logic, 2018)

On the Complexity of Infinite Advice Strings. - Gaëtan Douéneau-Tabot (ICALP, 2018)

Comparing the power of advice strings: a notion of complexity for infinite words. - Gaëtan Douéneau-Tabot (CoRR, 2018)

Register Transducers Are Marble Transducers. - Gaëtan Douéneau-Tabot; Emmanuel Filiot; Paul Gastin (MFCS, 2020)

Pebble Transducers with Unary Output. - Gaëtan Douéneau-Tabot (MFCS, 2021)

Hiding Pebbles When the Output Alphabet Is Unary. - Gaëtan Douéneau-Tabot (ICALP, 2022)

Continuous Rational Functions Are Deterministic Regular. - Olivier Carton; Gaëtan Douéneau-Tabot (MFCS, 2022)

Pebble minimization: the last theorems. - Gaëtan Douéneau-Tabot (FoSSaCS, 2023)

Deterministic Regular Functions of Infinite Words. - Olivier Carton; Gaëtan Douéneau-Tabot; Emmanuel Filiot; Sarah Winter (ICALP, 2023)

ℤ-polyregular functions. - Thomas Colcombet; Gaëtan Douéneau-Tabot; Aliaume Lopez (LICS, 2023)