论文信息 - Solving Word Equations - 字舞流文

Solving Word Equations

Pure associative unification is equivalent to the resolution of word equations. We give a short survey of known results and algorithms in this field and describe the central algorithm of Makanin.

Habib Abdulrab | Jean-Pierre Pécuchet

[1] R. Lyndon. Equations in free groups , 1960 .

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

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

[4] Habib Abdulrab. Implementation of Makanin's Algorithm , 1990, IWWERT.

[5] Michael H. Albert,et al. A Proof of Ehrenfeucht's Conjecture , 1985, Theor. Comput. Sci..

[6] François Fages,et al. Complete Sets of Unifiers and Matchers in Equational Theories , 1983, CAAP.

[7] G S Makanin. On the Rank of Coefficientless Equations in Four Unknowns in a Free Semigroup , 1976 .

[8] G. Makanin. EQUATIONS IN A FREE GROUP , 1983 .

[9] J. Nielsen,et al. Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden , 1917 .

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

[11] C. Kirchner. From Unification in Combination of Equational Theories to a New AC-Unification Algorithm , 1989 .

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

[13] Jean-Pierre Pécuchet. Solutions principales et rang d'un système d'équations avec constantes dans le monoïde libre , 1984, Discret. Math..