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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Group Theory, 20E06, 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/231468

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.4395
 http://arxiv.org/abs/0905.4395

Collections

arXiv