The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.

Published in: FCT (2007)

Keyphrases

programming language
language learning
datalog programs
sufficient conditions
logic programming
language processing
finite automata
software engineering
conceptual graphs
target language