JournalsggdVol. 20, No. 3pp. 1099–1145

The finiteness problem for groups generated by reset automata

  • Feyishayo Olukoya

    Keele University, UK
The finiteness problem for groups generated by reset automata cover
Download PDF

This article is published open access under our Subscribe to Open model.

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. 20 (2026), no. 3, pp. 1099–1145

DOI 10.4171/GGD/838