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 prob
lem. (C) 1999 Elsevier Science B.V. All rights reserved.