David Eppstein, Zvi Galil, et al.
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.
David Eppstein, Zvi Galil, et al.
Journal of the ACM
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
Sashi Novitasari, Takashi Fukuda, et al.
INTERSPEECH 2025