The finiteness problem for groups generated by reset automata

We provide sufficient conditions for when a group generated by a strongly synchronizing automaton (generalizations of reset automata) has infinite order.

Authors

Institutions

Publication Details

Journal
Groups Geometry and Dynamics
Published
2024-11-08
DOI
https://doi.org/10.4171/ggd/838
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The finiteness problem for groups generated by reset automata

Feyishayo Olukoya
Groups Geometry and Dynamics
semigroups and automata theory
article

The finiteness problem for groups generated by reset automata

Feyishayo Olukoya
article en

Abstract

We provide sufficient conditions for when a group generated by a strongly synchronizing automaton (generalizations of reset automata) has infinite order.

Groups Geometry and Dynamics
Keele University (GB)
Openalex Percentile: Top 76%
semigroups and automata theory
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The finiteness problem for groups generated by reset automata — Feyishayo Olukoya · Groups Geometry and Dynamics (2024) | TGRS Research Map | TGRS