Using string-rewriting for solving the word problem for finitely presented groups (Q580494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4017172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using string-rewriting for solving the word problem for finitely presented groups |
scientific article; zbMATH DE number 4017172 |
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
0 references
