Finite automata for Schreier graphs of virtually free groups

Details Finite automata for Schreier graphs of virtually free groups Finite automata for Schreier graphs of virtually free groups

2011-12-24

arxiv.org/abs/1112.5709v1

Mathematics

Group Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Finite automata for Schreier graphs of virtually free groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite automata for Schreier graphs of virtually free groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite automata for Schreier graphs of virtually free groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590920