Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
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.
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Imran Nasim, Melanie Weber
SCML 2024
Arnold L. Rosenberg
Journal of the ACM
Dzung Phan, Vinicius Lima
INFORMS 2023