An automata theoretic approach to the generalized word problem in graphs of groups

Details An automata theoretic approach to the generalized word problem in graphs of groups An automata theoretic approach to the generalized word problem in graphs of groups

2009-05-27

arxiv.org/abs/0905.4395v1

Mathematics

Group Theory

Scientific paper

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups in which edge groups are polycyclic-by-finite and vertex groups are either locally quasiconvex hyperbolic or polycyclic-by-finite and so in particular chordal graph groups (right-angled Artin groups).

Affiliated with

Also associated with

No associations

Rating

An automata theoretic approach to the generalized word problem in graphs of 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 An automata theoretic approach to the generalized word problem in graphs of groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An automata theoretic approach to the generalized word problem in graphs of groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527585