I'm new to the combinatorial group theory, so maybe my question is a bit naiive.


I know that the [word problem](http://en.wikipedia.org/wiki/Word_problem_for_groups) 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?



Any CAS that deals with the word problem 
Derek Holt's software kbmag (available [here](http://www.warwick.ac.uk/~mareg/)) is wonderfully good at solving the word problem of groups given by a finite presentation. Of course, the problem is undecidable in general!


Notice that kbmag can be installed as a GAP package, and then used through sage.


