Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218196798000132 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986593186 / rank | |||
Normal rank | |||
Latest revision as of 09:51, 30 July 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
0 references
0 references
0 references
