36 citations · 99 across the 12 of their papers we have counts for
Showing 2014 · cs.FLShow all
2 papers · 2 filters
cs.FL2014
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
Thibault Godin, Ines Klimann, Matthieu Picantin
This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers w…
cs.FL2014
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
Ines Klimann, Matthieu Picantin, Dmytro Savchuk
The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, there are some classes of automata that do not contain such examples.…