Word Equations and Related Topics

1. Front Matter

   PDF

2. On general solution of equations in a free semigroup

   • G. S. Makanin

   Pages 1-5

3. Conjugacy in free inverse monoids

   • Christian Choffrut

   Pages 6-22

4. General A- and AX-unification via optimized combination procedures

   • Franz Baader, Klaus U. Schulz

   Pages 23-42

5. Word equations with two variables

   • Witold Charatonik, Leszek Pacholski

   Pages 43-56

6. The naming problem for left distributivity

   • Patrick Dehornoy

   Pages 57-78

7. A case of termination for associative unification

   • Patrice Enjalbcrt, FranÇoise Clerin-Debart

   Pages 79-89

8. Theorem proving by combinatorial optimization

   • Hachemi Bennaceur, Gérard Plateau

   Pages 90-102

9. Solving string equations with constant restrictions

   • Peter Auer

   Pages 103-132

10. LOP: Toward a new implementation of Makanin's Algorithm

    • H. Abdulrab

    Pages 133-149

11. Word unification and transformation of generalized equations

    • Klaus U. Schulz

    Pages 150-176

12. Unification in the combination of disjoint theories

    • Peter Auer

    Pages 177-186

13. On the subsets of rank two in a free monoid: A fast decision algorithm

    • Jean Neraud

    Pages 187-196

14. A solution of the complement problem in associatiue-commutatiue theories

    • Kounalis Emmanuel, Lugiez Denis, Pottier Loic

    Pages 197-214

15. Back Matter

    PDF

This volume contains papers presented at the second International Workshop on Word Equations and Related Topics (IWWERT '91), held at the University ofRouen in October 1991. The papers are on the following topics: general solution of word equations, conjugacy in free inverse monoids, general A- and AX-unification via optimized combination procedures, wordequations with two variables, a conjecture about conjugacy in free groups, acase of termination for associative unification, theorem proving by combinatorial optimization, solving string equations with constant restriction, LOP (toward a new implementation of Makanin's algorithm), word unification and transformation of generalizedequations, unification in the combination of disjoint theories, on the subsets of rank two in a free monoid (a fast decision algorithm), and a solution of the complement problem in associative-commutative theories.

• Monoid
• Variable
• algorithms
• combinatorial optimization
• optimization
• proving
• theorem proving
• data structures

Policies and ethics