Using string-rewriting for solving the word problem for finitely presented groups (Q580494): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90149-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056285149 / rank | |||
Normal rank | |||
Revision as of 00:04, 20 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
