Using string-rewriting for solving the word problem for finitely presented groups (Q580494): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: M.Pałasiński / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 20F10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 20M05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 20M35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4017172 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
monoid presentation | |||
| Property / zbMATH Keywords: monoid presentation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
word problem | |||
| Property / zbMATH Keywords: word problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
string-rewriting | |||
| Property / zbMATH Keywords: string-rewriting / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity | |||
| Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithm | |||
| Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Revision as of 18:41, 1 July 2023
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
