I'm new to the combinatorial group theory, so maybe my question is a bit naiive.
I know that the word problem is generally "unsolvable". On the other hand there are specific cases, when the problem can be solved.
It seems that some computer algebra tool, that implements all the progress in that direction would be of use. Do you know any such tool? Or how to use existing CAS'es for this purpose?