Sciweavers

FCT
2007
Springer

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

14 years 5 months ago
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
Michal Kunc
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FCT
Authors Michal Kunc
Comments (0)