论文信息 - Solving Equations in Strings: On Makanin's Algorithm

Solving Equations in Strings: On Makanin's Algorithm

We present a further simplification of Makanin's algorithm, still the only known general procedure for solving string equations. We also give pseudo-code, a thorough analysis of its complexity, and complete proofs of correctness and termination.

Claudio Gutiérrez | C. Gutiérrez

[1] Leszek Pacholski,et al. Complexity of Makanin's algorithm , 1996, JACM.

[2] Klaus U. Schulz,et al. Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.

[3] Iu I Khmelevskiĭ. Equations in free semigroups , 1976 .

[4] André Lentin. Equations in Free Monoids , 1972, ICALP.

[5] Franz Baader,et al. Unification theory , 1986, Decis. Support Syst..

[6] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[7] Habib Abdulrab. Résolution d'équations sur les mots : étude et implémentation Lisp de l'algorithme de Makanin , 1987 .

[8] Joxan Jaffar. Minimal and complete word unification , 1990, JACM.

[9] Alfred V. Aho,et al. Algorithms for Finding Patterns in Strings , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.