On bireversible Mealy automata and the Burnside problem
type: Item
instance of: scholarly article
title: On bireversible Mealy automata and the Burnside problem
zbMATH Open document ID: 1405.68196
author: Thibault Godin
author: Ines Klimann
published in: Theoretical Computer Science
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 20F50
zbMATH DE Number: 6820509
zbMATH Keywords: Burnside problem
zbMATH Keywords: automaton groups
zbMATH Keywords: reversibility
zbMATH Keywords: Schreier tries
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.10.005
OpenAlex ID: W2762430665
cites work: Q5509036
cites work: Q5658240
cites work: On Burnside's problem on periodic groups
cites work: On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
cites work: A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
cites work: A geometric approach to (semi)-groups defined by automata via dual transducers.
cites work: CONJUGATION IN TREE AUTOMORPHISM GROUPS
cites work: Ergodic decomposition of group actions on rooted trees
cites work: Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
cites work: Implementing Computations in Automaton (Semi)groups
cites work: Q3483461
cites work: Q3362124
DOI: 10.1016/J.TCS.2017.10.005
description: scientific article; zbMATH DE number 6820509