Dehn's Algorithm and the Complexity of Word Problems (Q3826535): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:51, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dehn's Algorithm and the Complexity of Word Problems |
scientific article |
Statements
Dehn's Algorithm and the Complexity of Word Problems (English)
0 references
1988
0 references
finite Thue system
0 references
rewriting system
0 references
linear-time algorithm
0 references
