Word Problem For Groups
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G. If B is another finite generating set for G, then the word problem over the generating set B is equivalent to the word problem over the generating set A. Thus one can speak unambiguously of the decidability of the word problem for the finitely generated group G.
The related but different uniform word problem for a class K of recursively presented groups is the algorithmic problem of deciding, given as input a presentation P for a group G in the class K and two words in the generators of G, whether the words represent the same element of G. Some authors require the class K to be definable by a recursively enumerable set of presentations.
Read more about Word Problem For Groups: History, A More Concrete Description, Examples, Partial Solution of The Word Problem, Unsolvability of The Uniform Word Problem, Algebraic Structure and The Word Problem
Famous quotes containing the words word, problem and/or groups:
“Children show scars like medals. Lovers use them as secrets to reveal. A scar is what happens when the word is made flesh.”
—Leonard Cohen (b. 1934)
“But a problem occurs about nothing. For that from which something is made is a cause of the thing made from it; and, necessarily, every cause contributes some assistance to the effect’s existence.”
—Anselm of Canterbury (1033–1109)
“The awareness of the all-surpassing importance of social groups is now general property in America.”
—Johan Huizinga (1872–1945)