Thibault Godin

According to our database, Thibault Godin authored at least 12 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Numerical upper bounds on growth of automaton groups.

Jérémie Brieussel, Thibault Godin, Bijan Mohammadi

Int. J. Algebra Comput., 2022

2020

A New Hierarchy for Automaton Semigroups.

Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin

Int. J. Found. Comput. Sci., 2020

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

2019

Generic Properties in Some Classes of Automaton Groups.

Thibault Godin

Proceedings of the Cellular Automata and Discrete Complex Systems, 2019

2018

On bireversible Mealy automata and the Burnside problem.

Thibault Godin, Ines Klimann

Theor. Comput. Sci., 2018

Numerical upper bounds on growth of automata groups.

Jérémie Brieussel, Thibault Godin, Bijan Mohammadi

CoRR, 2018

A New Hierarchy for Automaton Semigroups.

Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin

Proceedings of the Implementation and Application of Automata, 2018

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

PhD thesis, 2017

An analogue to Dixon's theorem for automaton groups.

Thibault Godin

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

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

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups.

Thibault Godin, Ines Klimann

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata.

Thibault Godin, Ines Klimann, Matthieu Picantin

Proceedings of the Language and Automata Theory and Applications, 2015