{ "id": "1112.5709", "version": "v1", "published": "2011-12-24T09:11:36.000Z", "updated": "2011-12-24T09:11:36.000Z", "title": "Finite automata for Schreier graphs of virtually free groups", "authors": [ "Pedro Silva", "Xaro Soler-EscrivĂ ", "Enric Ventura" ], "categories": [ "math.GR" ], "abstract": "The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is proved that those groups admitting Stallings sections are precisely finitely generated virtually free groups, through a constructive approach based on Bass-Serre theory. Complexity issues and applications are also discussed.", "revisions": [ { "version": "v1", "updated": "2011-12-24T09:11:36.000Z" } ], "analyses": { "subjects": [ "20F10", "20E06" ], "keywords": [ "schreier graph", "finite automata", "generated virtually free groups", "finitely generated virtually free", "groups admitting stallings sections" ], "note": { "typesetting": "TeX", "pages": 0, "language": "en", "license": "arXiv", "status": "editable", "adsabs": "2011arXiv1112.5709S" } } }