Are there solvers for the Word Problem for finitely presented groups?

51 Views Asked by At

I know the Word Problem for finitely presented groups is undecidable in general.

I am looking for software that takes a FPG and a word as input and tries to figure out (using some heuristics) whether it is equal to the neutral element.