The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable (Q5444976)
From MaRDI portal
scientific article; zbMATH DE number 5241397
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable |
scientific article; zbMATH DE number 5241397 |
Statements
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable (English)
0 references
26 February 2008
0 references
