Matthieu Picantin

Publication Activity (10 Years)

Years Active: 2005-2020
Publications (10 Years): 10

Top Topics

Hierarchically Organized

Automatically Generating

Singular Points

Finite State Machines

Top Venues

Int. J. Found. Comput. Sci.

Int. J. Algebra Comput.

Publications

Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin
A New Hierarchy for Automaton Semigroups. Int. J. Found. Comput. Sci. 31 (8) (2020)
Daniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro
Boundary dynamics for bireversible and for contracting automaton groups. Int. J. Algebra Comput. 30 (02) (2020)
Matthieu Picantin
Automatic Semigroups vs Automaton Semigroups. ICALP (2019)
Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin
A new hierarchy for automaton semigroups. CoRR (2018)
Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin
A New Hierarchy for Automaton Semigroups. CIAA (2018)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. Int. J. Found. Comput. Sci. 29 (2) (2018)
Daniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro
Boundary action of automaton groups without singular points and Wang tilings. CoRR (2016)
Matthieu Picantin
Automatic semigroups vs automaton semigroups. CoRR (2016)
Thibault Godin, Ines Klimann, Matthieu Picantin
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. LATA (2015)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. DLT (2015)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group. CoRR (2014)
Thibault Godin, Ines Klimann, Matthieu Picantin
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. CoRR (2014)
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
Orbit automata as a new tool to attack the order problem in automaton groups. CoRR (2014)
Ines Klimann, Matthieu Picantin
A Characterization of Those Automata That Structurally Generate Finite Groups. LATIN (2014)
Ines Klimann, Jean Mairesse, Matthieu Picantin
Implementing Computations in Automaton (Semi)groups. CoRR (2013)
Ines Klimann, Matthieu Picantin
A characterization of those automata that structurally generate finite groups. CoRR (2013)
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
On the Finiteness Problem for Automaton (Semi)Groups. Int. J. Algebra Comput. 22 (6) (2012)
Ines Klimann, Jean Mairesse, Matthieu Picantin
Implementing Computations in Automaton (Semi)groups. CIAA (2012)
Ruth Corran, Matthieu Picantin
). J. Lond. Math. Soc. 84 (3) (2011)
Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
On the Finiteness Problem for Automaton (Semi)groups CoRR (2011)
Matthieu Picantin
Garside monoids vs divisibility monoids CoRR (2007)
Matthieu Picantin
Finite transducers for divisibility monoids. Theor. Comput. Sci. 362 (1-3) (2006)
Matthieu Picantin
Garside monoids vs divisibility monoids. Math. Struct. Comput. Sci. 15 (2) (2005)