Forum Problem Lists Definitions FAQ

20.68 (2022)

Open

The submonoid membership problem for a group $G$ generated by an alphabet $A$ asks, for given words $x_1, x_2, \dots, x_n$ and a word $w$ over $A$, whether $w$ belongs to the submonoid of $G$ generated by the $x_i$. Does there exist a hyperbolic one-relator group with undecidable submonoid membership problem?

Contributor: C.-F. Nyberg Brodda

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.