Submonoids and rational subsets of groups with infinitely many ends

2009/07/04 by Markus Lohrey, Lohrey, Markus, Benjamin Steinberg +1
Computer Science · Mathematics · #Advanced Topics in Algebra #Finite Group Theory Research #math.GR #msc:20E06 #msc:20E08 #msc:20F10 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0907.0787

arxiv created 2009/07/04 · arxiv updated 2009/12/01

Abstract

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.

Related

• Is decidability of the Submonoid Membership Problem closed under finite extensions?
• The submonoid and rational subset membership problems for graph groups
• Rational Subsets and Submonoids of Wreath Products
• The submonoid and rational subset membership problems for Artin groups
• Membership problems in braid groups and Artin groups