Garside monoids vs divisibility monoids. - Matthieu Picantin (Math. Struct. Comput. Sci., 2005)

Finite transducers for divisibility monoids. - Matthieu Picantin (Theor. Comput. Sci., 2006)

A new Garside structure for the braid groups of type (e, e, r). - Ruth Corran; Matthieu Picantin (J. Lond. Math. Soc., 2011)

Implementing Computations in Automaton (Semi)groups. - Ines Klimann; Jean Mairesse; Matthieu Picantin (CIAA, 2012)

On the Finiteness Problem for Automaton (Semi)Groups. - Ali Akhavi; Ines Klimann; Sylvain Lombardy; Jean Mairesse; Matthieu Picantin (Int. J. Algebra Comput., 2012)

A Characterization of Those Automata That Structurally Generate Finite Groups. - Ines Klimann; Matthieu Picantin (LATIN, 2014)

Orbit automata as a new tool to attack the order problem in automaton groups. - Ines Klimann; Matthieu Picantin; Dmytro Savchuk (CoRR, 2014)

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

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

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

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. - Ines Klimann; Matthieu Picantin; Dmytro Savchuk (Int. J. Found. Comput. Sci., 2018)

Automatic Semigroups vs Automaton Semigroups. - Matthieu Picantin (ICALP, 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)