Using string-rewriting for solving the word problem for finitely presented groups
It is shown that the word problem for the group \(<\{a,b\}\), \(abba=1>\) can be solved through the technique of string-rewriting. The time complexity of the algorithm is given.
scientific article; zbMATH DE number 4017172