( en | de | ru )

 

Disambiguation of "Picantin, Matthieu"

Author of the publication

copydeleteadd this publication to your clipboard
On the Finiteness Problem for Automaton (Semi)groups

, , , , and . (2011)cite http://arxiv.org/abs/1105.4725arxiv:1105.4725.
DOI: 10.1142/S021819671250052X

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthieu Felsinger

Matthieu Hammer

Matthieu Saubanère

Friedrich Matthieu

Matthieu Barukinamwo

 

Other publications of authors with the same name

Implementing Computations in Automaton (Semi)groups., , and . CIAA, volume 7381 of Lecture Notes in Computer Science, page 240-252. Springer, (2012)On the Finiteness Problem for Automaton (Semi)Groups., , , , and . Int. J. Algebra Comput., (2012)A New Hierarchy for Automaton Semigroups., , , , and . Int. J. Found. Comput. Sci., 31 (8): 1069-1089 (2020)A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group., , and . CoRR, (2014)On the Finiteness Problem for Automaton (Semi)groups, , , , and . (2011)cite http://arxiv.org/abs/1105.4725arxiv:1105.4725.A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group., , and . DLT, volume 9168 of Lecture Notes in Computer Science, page 313-325. Springer, (2015)Implementing Computations in Automaton (Semi)groups., , and . CoRR, (2013)A Characterization of Those Automata That Structurally Generate Finite Groups., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 180-189. Springer, (2014)Automatic Semigroups vs Automaton Semigroups.. ICALP, volume 132 of LIPIcs, page 124:1-124:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)