Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
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.
Pavel Klavík, A. Cristiano I. Malossi, et al.
Philos. Trans. R. Soc. A
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Joseph Y. Halpern, Yoram Moses
Journal of the ACM