A list of applications of stallings automata
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 promi...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2022 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/385670 |
| Acesso em linha: | https://hdl.handle.net/2117/385670 https://dx.doi.org/10.22108/TOC.2021.130387.1905 |
| Access Level: | acceso abierto |
| Palavra-chave: | 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 Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Teoria de grups |
| Resumo: | 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. |
|---|