Using string-rewriting for solving the word problem for finitely presented groups (Q580494): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:41, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using string-rewriting for solving the word problem for finitely presented groups |
scientific article |
Statements
Using string-rewriting for solving the word problem for finitely presented groups (English)
0 references
1987
0 references
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.
0 references
monoid presentation
0 references
word problem
0 references
string-rewriting
0 references
complexity
0 references
algorithm
0 references