Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:28, 5 March 2024
scientific article; zbMATH DE number 1060737
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem |
scientific article; zbMATH DE number 1060737 |
Statements
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (English)
0 references
15 September 1997
0 references
finitely generated semigroups
0 references
word problem
0 references
time complexity
0 references
isoperimetric functions
0 references
finitely presented semigroups
0 references
