Showing math.GRShow all
3 papers · 1 filter
math.GR2009
Submonoids and rational subsets of groups with infinitely many ends
Markus Lohrey, Benjamin Steinberg
In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.
math.GR2009
An automata theoretic approach to the generalized word problem in graphs of groups
Markus Lohrey, Benjamin Steinberg
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 t…
math.GR2009★ 1 cited
Tilings and Submonoids of Metabelian Groups
Markus Lohrey, Benjamin Steinberg
In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product $\mathbb Z\wr (\mathbb Z\ti…