A list of applications of Stallings automata
Publish place: Transactions on Combinatorics، Vol: 11، Issue: 3
Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 94
This Paper With 55 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-11-3_005
تاریخ نمایه سازی: 4 تیر 1401
Abstract:
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.
Keywords:
Authors
Jordi Delgado
Department of Mathematics, University of the Basque Country, Faculty of Science and Technology, Barrio Sarriena, s/n ۴۸۹۴۰ Leioa, Spain
Enric Ventura
Departament de Matemàtiques, Universitat Politècnica de Catalunya and Institut de Matemàtiques de la UPC-BarcelonaTech, Barcelona, Catalunya