The complexity of Dehn's algorithm for word problems in groups (Q3718927): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:45, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of Dehn's algorithm for word problems in groups |
scientific article |
Statements
The complexity of Dehn's algorithm for word problems in groups (English)
0 references
1985
0 references
Dehn's algorithm
0 references
Turing machine
0 references
word problem
0 references
DA-group
0 references
