- Border between decidability and undecidability for the finiteness of automata groups.
- Existence of a bireversible Mealy automaton whose generated group addresses the Burnside problem.
proposalthe position has been filled
mealym@liafa.univ-paris-diderot.fr