Laureline Pinault. From automata to cyclic proofs : equivalence algorithms and descriptive complexity. (Des automates aux preuves cycliques : algorithmes d'équivalence et complexité descriptive). PhD thesis, University of Lyon, France, 2021. [doi]
Abstract is missing.