821 citations
- Max Planck SocietyDE5 papers
- Ludwig-Maximilians-Universität MünchenDE4 papers
- North-West State Technical UniversityRU4 papers
- Research Institute of Precision Instruments (Russia)RU4 papers
- University of EdinburghGB4 papers
- Carleton UniversityCA3 papers
- Center for NanoScienceDE3 papers
- Deutsches Elektronen-Synchrotron DESYDE3 papers
- Forschungszentrum JülichDE3 papers
- Harvard UniversityUS3 papers
- Helmholtz-Zentrum Dresden-RossendorfDE3 papers
- Humboldt-Universität zu BerlinDE3 papers
4 papers · 1 filter
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.
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…
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…
Compressed word problems in HNN-extensions and amalgamated products
Niko Haubold, Markus Lohrey
It is shown that the compressed word problem for an HNN-extension with base group H and finite associated subgroups is polynomial time Turing-reducible to the compressed word probl…