THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (Q4786249): Difference between revisions
From MaRDI portal
Revision as of 18:15, 4 June 2024
scientific article; zbMATH DE number 1845089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS |
scientific article; zbMATH DE number 1845089 |
Statements
THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (English)
0 references
15 December 2002
0 references
finitely presented monoids
0 references
undecidability
0 references
word problem
0 references
finite derivation type
0 references
0 references
