Coinductive Algorithms for Büchi Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (DLT, 2019)

Cyclic Proofs and Jumping Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (FSTTCS, 2019)

Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable. - Raphaël Berthon; Emmanuel Filiot; Shibashis Guha; Bastien Maubert; Aniello Murano; Laureline Pinault; Jean-François Raskin; Sasha Rubin (CoRR, 2019)

Cyclic proofs, system t, and the power of contraction. - Denis Kuperberg; Laureline Pinault; Damien Pous (Proc. ACM Program. Lang., 2021)

Alternating Tree Automata with Qualitative Semantics. - Raphaël Berthon; Nathanaël Fijalkow; Emmanuel Filiot; Shibashis Guha; Bastien Maubert; Aniello Murano; Laureline Pinault; Sophie Pinchinat; Sasha Rubin; Olivier Serre (ACM Trans. Comput. Log., 2021)

From automata to cyclic proofs : equivalence algorithms and descriptive complexity. (Des automates aux preuves cycliques : algorithmes d'équivalence et complexité descriptive). - Laureline Pinault (2021)