Monadic simultaneous rigid E-unification
โ
Yuri Gurevich; Andrei Voronkov
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 998 KB
We study the monadic case of a decision problem known as simultaneous rigid E-unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. (~