Thématiques : Groupe d’automates, génération aléatoire et croissance de groupes, et de manière plus générale, informatique théorique et mathématiques discrètes, en particulier théorie des automates, pavages, théorie des jeux.
- Numerical upper bounds on growth of automaton groups avec/with J. Brieussel, et B. Mohammadi ; International Journal of Algebra and Computation, vol. 32, 2021
- A new hierarchy for automaton semigroups avec/with L. Bartholdi, I. Klimann, et M. Picantin , International Journal of Foundations of Computer Science, vol. 31, 2020
- Boundary dynamics for bireversible and for contracting automaton groups}} avec/with D. D’Angeli, I. Klimann, M.Picantin, et E. Rodaro, International Journal of Algebra and Computation, vol. 30, no. 2, 2020
-On bireversible Mealy automata and the Burnside problem avec/with Ines Klimann ; Theoretical Computer Science 2018,[bibtex].
-Generic properties in some classes of automaton groups; AUTOMATA 2019
-A new hierarchy for automaton semigroups avec/with Laurent Bartholdi, Ines Klimann & Matthieu Picantin ; CIAA 2018,[bibtex].
-An Analogue to Dixon’s Theorem for Automaton Groups ; ANALCO 2017,[bibtex].
-Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups avec/with Ines Klimann ; MFCS 2016,[bibtex].
-Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata avec/with Ines Klimann & Matthieu Picantin ; LATA 2015,[bibtex].
Dahmani group is linear-contracting Appendice à un article en préparation de J.~Brieussel et T.~Zheng
-Boundary action of automaton groups without singular points and Wang tilings avec/with Daniele d’Angeli, Ines Klimann, Matthieu Picantin & Emanuele Rodaro.
-manuscript soutenue/defended on the 13th of July (slides).
-poster summarizing the links between reversibility and the Burnside problem (version en français).
I was a reviewer for CSR, STACS, MFCS and ToCS
- Numerical upper bounds on growth of automata groups Code GAP