Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups

Résumé

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 paper, we extend these results to automata with bigger stateset, proving that, if a connected reversible automaton has a prime number of states, it cannot generate an infinite Burnside group.
Fichier principal
Vignette du fichier
prime_reversible_cannot_generate_burnside_mfcs_hal.pdf (264.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01296590 , version 1 (07-04-2016)
hal-01296590 , version 2 (31-08-2016)

Identifiants

Citer

Thibault Godin, Ines Klimann. Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Piotr Faliszewski; Anca Muscholl; Rolf Niedermeier, Aug 2016, Cracovie, Poland. pp.44:1--44:14. ⟨hal-01296590v2⟩
185 Consultations
59 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More