Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

FCT
2007
Springer

favoriteEmaildiscussreport

63views Applied Computing» more FCT 2007»

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

13 years 11 months ago

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

Download www.math.muni.cz

Michal Kunc

Real-time Traffic

FCT 2007 |

claim paper

Related Content

» Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FCT
Authors	Michal Kunc

Comments (0)