Matthieu Picantin

Orcid: 0000-0002-7149-1770

According to our database1, Matthieu Picantin authored at least 14 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A New Hierarchy for Automaton Semigroups.
Int. J. Found. Comput. Sci., 2020

Boundary dynamics for bireversible and for contracting automaton groups.
Int. J. Algebra Comput., 2020

2019
Automatic Semigroups vs Automaton Semigroups.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group.
Int. J. Found. Comput. Sci., 2018

A New Hierarchy for Automaton Semigroups.
Proceedings of the Implementation and Application of Automata, 2018

2016
Boundary action of automaton groups without singular points and Wang tilings.
CoRR, 2016

2015
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Orbit automata as a new tool to attack the order problem in automaton groups.
CoRR, 2014

A Characterization of Those Automata That Structurally Generate Finite Groups.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2012
On the Finiteness Problem for Automaton (Semi)Groups.
Int. J. Algebra Comput., 2012

Implementing Computations in Automaton (Semi)groups.
Proceedings of the Implementation and Application of Automata, 2012

2011
A new Garside structure for the braid groups of type (<i>e</i>, <i>e</i>, <i>r</i>).
J. Lond. Math. Soc., 2011

2006
Finite transducers for divisibility monoids.
Theor. Comput. Sci., 2006

2005
Garside monoids vs divisibility monoids.
Math. Struct. Comput. Sci., 2005


  Loading...