The finiteness problem for groups generated by reset automata
Feyishayo Olukoya
Keele University, Keele, UK
Abstract
We provide sufficient conditions for when a group generated by a strongly synchronizing automaton (generalizations of reset automata) has infinite order.
Cite this article
Feyishayo Olukoya, The finiteness problem for groups generated by reset automata. Groups Geom. Dyn. (2024), published online first
DOI 10.4171/GGD/838