On Orbits and the Finiteness of Bounded Automaton Groups
Group Theory
2021-09-09 v3 Formal Languages and Automata Theory
Abstract
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state acceptor. This acceptor can also be used to decide whether the bounded automaton acts level-transitively.
Keywords
Cite
@article{arxiv.1912.06897,
title = {On Orbits and the Finiteness of Bounded Automaton Groups},
author = {Ievgen Bondarenko and Jan Philipp Wächter},
journal= {arXiv preprint arXiv:1912.06897},
year = {2021}
}
Comments
Content and theorem numbers match the published version