CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS (Q3429796)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5135182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS |
scientific article; zbMATH DE number 5135182 |
Statements
CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS (English)
0 references
20 March 2007
0 references
automatic semigroups
0 references
cancellative semigroups
0 references
Post correspondence problem
0 references
undecidability
0 references
string rewriting systems
0 references
0 references
0.85477567
0 references
0.84255713
0 references
0.8342404
0 references
0 references
0 references
0 references
