| 释义 |
word problem (group theory) Given a (finite) presentation for a group in terms of generators and relations, the word problem is to find an algorithm that determines whether two words in the generators represent the same group element. The general word problem is not decidable but is decidable for certain types of group.
|