Finite automata for Schreier graphs of virtually free groups
Group Theory
2011-12-30 v1
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.
Keywords
Cite
@article{arxiv.1112.5709,
title = {Finite automata for Schreier graphs of virtually free groups},
author = {Pedro Silva and Xaro Soler-Escrivà and Enric Ventura},
journal= {arXiv preprint arXiv:1112.5709},
year = {2011}
}