#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2015

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Thibault Godin, Ines Klimann, Matthieu Picantin
- LATA
- 2015

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 with the same input and output alphabet. The torsion problem is undecidable for automaton semigroups in general, but is known to be solvable within the well-studied class of… (More)

We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem of finding examples of infinite bireversible automaton groups with all trivial stabilizers in the boundary, raised by Grigorchuk and Savchuk. We show that, in… (More)

- Thibault Godin
- 2016

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups. In this paper we deal with groups generated by Mealy automata—a class that is often used to study group-theoretical… (More)

- Thibault Godin, Ines Klimann
- MFCS
- 2016

The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of size at most 3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite. In this… (More)

- Thibault Godin
- ANALCO
- 2017

Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that it is hopeless to wish for a uniform distribution – or even a non-trivial one – by drawing random permutations and… (More)

- ‹
- 1
- ›