An automata theoretic approach to the generalized word problem in graphs of groups
Group Theory
2009-05-28 v1
Abstract
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).
Keywords
Cite
@article{arxiv.0905.4395,
title = {An automata theoretic approach to the generalized word problem in graphs of groups},
author = {Markus Lohrey and Benjamin Steinberg},
journal= {arXiv preprint arXiv:0905.4395},
year = {2009}
}