Solving string equations with constant restrictions

  • Peter Auer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 677)


We present a variant and extension of Makanin's [5] decision algorithm for string equations: Given are sets C = {c1,..., cm} of constants, V = {x1,..., xn} of variables and a string equation s1
s2 where s1, s2 ε (CV)+. Furthermore sets r(x i ) ∈ C, 1 ≤ i <- n, are given which are called constant restrictions. A substitution σ solves the equation s1
s2 and satisfies the constant restrictions R(x i ), 1 ≤ i<-n, if σ(s1) = σ(s2) and σ(x i ) ε ((C-R(x i )) ∪ V)+ for all x i ε V. I.e. we consider solutions of string equations such that certain constants do not appear in the substitutions of some variables.

Modifying the decision algorithm of Makanin we obtain an algorithm which decides whether or not a given string equation has a solution satisfying the constant restrictions. Furthermore we think that we have, as a by-product, a very nice presentation of Makanin's algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Peter Auer. Unification in the combination of disjoint theories. 1991. To be published in the proceedings of the IWWERT'91.Google Scholar
  2. [2]
    Peter Auer. Unification with associative functions. PhD thesis, Technical University Vienna, 1992.Google Scholar
  3. [3]
    Franz Baader and Klaus Schulz. Unification in the union of disjoint equational theories: combining decision procedures. 1991. To be published in the proceedings of the IWWERT'91.Google Scholar
  4. [4]
    Joxan Jaffer. Minimal and complete word unification. Journal of the Association for Computing Machinery, 37(1):47–85, January 1990.Google Scholar
  5. [5]
    G. S. Makanin. The problem of solvability of equations in a free semiproup. Math. USSR Sbornik, 32(2):129–198, 1977. English translation.Google Scholar
  6. [6]
    G. S. Makanin. Recognition of the rank of equations in a free semigroup. Math. USSR Izvestija, 14(3):499–545, 1980. English translation.Google Scholar
  7. [7]
    J. P. Pecuchet. Equations avec constantes et algorithme de Makanin. PhD thesis, Laboratoire d' informatique, Rouen, 1981.Google Scholar
  8. [8]
    Klaus U. Schulz. Makanin's Algorithm — Two Improvements and a Generalization. Technical Report 91-39, CIS—UniversitÄt München, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Peter Auer
    • 1
  1. 1.Institut für ComputergraphikTechnical University ViennaAustria

Personalised recommendations