Solution of the membership problem of the prefix monoid in certain one-relator groups. (Q2340368)

Let \(R\) be a cyclically reduced word over a finite set of (group) generators \(X\), \(G=\text{gp}\langle X\mid R\rangle\) a one-relator group, \(\mathcal P_R\subseteq G\) the prefix monoid, generated by proper prefixes of the word \(R\), \(S=\text{Inv}\langle X\mid R\rangle\) the one-relator inverse monoid with the same presentation. It is shown that if \(R\) satisfies certain conditions then the membership problem for \(\mathcal P_R\) is solvable; from this follows, that the word problem for \(S\) is also solvable.