36 citations · 99 across the 12 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.FL2013
A characterization of those automata that structurally generate finite groups
Ines Klimann, Matthieu Picantin
Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--g…
cs.FL2013★ 36 cited
Implementing Computations in Automaton (Semi)groups
Ines Klimann, Jean Mairesse, Matthieu Picantin
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive…
math.GR2013
Cyclic amalgams, HNN extensions, and Garside one-relator groups
Matthieu Picantin
Garside groups are a natural lattice-theoretic generalisation of the braid groups and spherical type Artin--Tits groups. Here we show that the class of Garside groups is closed und…