Matthieu Picantin

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