Is decidability of the Submonoid Membership Problem closed under finite extensions?

Autor:	Shafrir, Doron
Rok vydání:	2024
Předmět:	Mathematics - Group Theory Computer Science - Formal Languages and Automata Theory
Druh dokumentu:	Working Paper
Popis:	We show that the rational subset membership problem in $G$ can be reduced to the submonoid membership problem in $G{\times}H$ where $H$ is virtually Abelian. We use this to show that there is no algorithm reducing submonoid membership to a finite index subgroup uniformly for all virtually nilpotent groups. We also provide evidence towards the existence of a group $G$ with a subgroup $H
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2405.12921 Zobrazit plný text záznamu View this record from Arxiv