On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. - Thibault Godin; Ines Klimann; Matthieu Picantin (LATA, 2015)

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups. - Thibault Godin; Ines Klimann (MFCS, 2016)

Boundary action of automaton groups without singular points and Wang tilings. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (CoRR, 2016)

An analogue to Dixon's theorem for automaton groups. - Thibault Godin (ANALCO, 2017)

Machines de Mealy, (semi-)groupes d'automate, problèmes de décision et génération aléatoire. (Mealy Machines, automaton (semi)groups, decision problems and random generation). - Thibault Godin (2017)

A New Hierarchy for Automaton Semigroups. - Laurent Bartholdi; Thibault Godin; Ines Klimann; Matthieu Picantin (CIAA, 2018)

Numerical upper bounds on growth of automata groups. - Jérémie Brieussel; Thibault Godin; Bijan Mohammadi (CoRR, 2018)

On bireversible Mealy automata and the Burnside problem. - Thibault Godin; Ines Klimann (Theor. Comput. Sci., 2018)

Generic Properties in Some Classes of Automaton Groups. - Thibault Godin (Automata, 2019)

Boundary dynamics for bireversible and for contracting automaton groups. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (Int. J. Algebra Comput., 2020)

A New Hierarchy for Automaton Semigroups. - Laurent Bartholdi; Thibault Godin; Ines Klimann; Camille Noûs; Matthieu Picantin (Int. J. Found. Comput. Sci., 2020)

Numerical upper bounds on growth of automaton groups. - Jérémie Brieussel; Thibault Godin; Bijan Mohammadi (Int. J. Algebra Comput., 2022)