Article ID Journal Published Year Pages File Type
6875718 Theoretical Computer Science 2018 12 Pages PDF
Abstract
In this paper we prove that, in fact, no connected reversible Mealy automaton of prime size can generate an infinite Burnside group. In addition we explain how our method can be applied for some Mealy automata of non prime size.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On bireversible Mealy automata and the Burnside problem
Authors
, ,