Dehn's Algorithm and the Complexity of Word Problems (Q3826535): 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.2307/2322385 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094015074 / rank | |||
Normal rank | |||
Latest revision as of 23:59, 19 March 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
