2000 character limit reached
Rational Subsets and Submonoids of Wreath Products
Published 11 Feb 2013 in math.GR and cs.FL | (1302.2455v1)
Abstract: It is shown that membership in rational subsets of wreath products H \wr V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath product Z \wr Z with an undecidable membership problem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
