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

Simple item page
dc.creatorLohrey, Markus
dc.creatorSteinberg, Benjamin
dc.date2009-05-27
dc.date.accessioned2026-07-07T13:18:34Z
dc.date.available2026-07-07T13:18:34Z
dc.descriptionWe 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).
dc.identifierhttps://arxiv.org/abs/0905.4395
dc.identifierhttp://arxiv.org/abs/0905.4395
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231468
dc.subjectGroup Theory
dc.subject20E06, 20F10
dc.titleAn automata theoretic approach to the generalized word problem in graphs of groups
dc.typetext

Files

Collections

arXiv