Using string-rewriting for solving the word problem for finitely presented groups (Q580494): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Confluent and Other Types of Thue Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3677188 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3714064 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on a special one-rule semi-Thue system / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4430312 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite Thue system with decidable word problem and without equivalent finite canonical system / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On deciding whether a monoid is a free monoid or is a group / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class / rank | |||
Normal rank | |||
Latest revision as of 12:20, 18 June 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
0 references
