CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS (Q3429796)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS |
scientific article |
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
