arXiv:1912.06897 Abstract | arXiv Analytics

arXiv:1912.06897 [math.GR]Abstract References Reviews Resources

On Orbits and the Finiteness of Bounded Automaton Groups

Published 2019-12-14Version 1

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.

Categories: math.GR, cs.FL

Subjects: 20F10, 20M35, F.4.m

Keywords: bounded automaton groups, finiteness, deterministic finite-state acceptor, solution comes, bounded automaton acts

Related articles: Most relevant | Search more

arXiv:1512.02133 [math.GR] (Published 2015-12-07)

Full groups of bounded automaton groups

Nicolás Matte Bon

arXiv:2308.14554 [math.GR] (Published 2023-08-28)

A comprehensive characterization of Property A and almost finiteness

Gábor Elek, Ádám Timár

arXiv:1609.04874 [math.GR] (Published 2016-09-15)

Finiteness of Homological Filling Functions