In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G {\displaystyle G} is the algorithmic problem of deciding whether two words in the generators represent the same element of G {\displaystyle G} . The word problems for certain groups provide well-known examples of undecidable problems.
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G {\displaystyle G} is the algorithmic problem of deciding whether two words in the generators represent the same element of G {\displaystyle G} . The word problems for certain groups provide well-known examples of undecidable problems.
Source: Wikipedia "Word problem for groups" · CC BY-SA 4.0
Share this article: X · Bluesky