Monadic Simultaneous Rigid E-Unification and Related Problems
- Yuri Gurevich ,
- Andrei Voronkov
24th Intern. Colloquium on Automata, Languages and Programming ICALP'97, Bologna, Italy. Springer Lecture Notes in Computer Science. |
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.