All Questions

Suppose we have a finitely presented group $G$ with solvable word problem. (For instance, the command RWSGroup in Magma terminates giving us a finite [but possibly gigantic] rewrite system.) Is there ...

First, allow me to say that this problem was posed to me by a professor in the department. It is related to his research in a way that I do not know. However, since I couldn't come up with anything ...

What's the current state of one-rule semi-Thue system termination problem? Search produces a lot of references, but it's hard to find out if decidability of this problem has been proven or not.