2026-04-14T02:18:02Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/3856702026-01-22T03:50:43Zcom_2072_1033col_2072_452950

00925njm 22002777a 4500 dc Delgado Pin, Jordi author Ventura Capell, Enric author 2022-11-22 This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently, results concerning finitely generated subgroups have greater prominence in the paper. However, when possible, we try to state the results with more generality, including the usually overlooked non-(finitely-generated) case. Peer Reviewed Postprint (published version) Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups Group theory Free group Subgroups Automaton Foldings Algorithmic problem Grups infinits Grups finits Classificació AMS::20 Group theory and generalizations::20E Structure and classification of infinite or finite groups Classificació AMS::20 Group theory and generalizations::20F Special aspects of infinite or finite groups A list of applications of stallings automata