P.C. Yue, C.K. Wong
Journal of the ACM
The fundamental satisfiability problem for word equations has been solved recently by Makanin. However, this algorithm is purely a decision algorithm. The main result of this paper solves the complementary problem of generating the set of all solutions. Specifically, the algorithm in this paper generates, given a word equation, a minimal and complete set of unifiers. It stops if this set is finite. © 1990, ACM. All rights reserved.
P.C. Yue, C.K. Wong
Journal of the ACM
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Rie Kubota Ando
CoNLL 2006
Zhikun Yuen, Paula Branco, et al.
DSAA 2023