License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.44
URN: urn:nbn:de:0030-drops-64570
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6457/
Go to the corresponding LIPIcs Volume Portal


Godin, Thibault ; Klimann, Ines

Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups

pdf-format:
LIPIcs-MFCS-2016-44.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{godin_et_al:LIPIcs:2016:6457,
  author =	{Thibault Godin and Ines Klimann},
  title =	{{Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{44:1--44:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6457},
  URN =		{urn:nbn:de:0030-drops-64570},
  doi =		{10.4230/LIPIcs.MFCS.2016.44},
  annote =	{Keywords: Burnside problem, automaton groups, reversibility, orbit trees}
}

Keywords: Burnside problem, automaton groups, reversibility, orbit trees
Collection: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue Date: 2016
Date of publication: 19.08.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI