Advertisement

Solving equations in strings: On Makanin's algorithm

  • Claudio Gutiérrez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1380)

Abstract

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.

Keywords

Generalize Equation Variable Base Boundary Sequence Left Boundary Boundary Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. Abdulrab, 1987. Résolution d'équations sur les mots: étude et implémentation LISP de l'algoritme de Makanin, Ph.D. dissertation, Univ. Rouen, Rouen.Google Scholar
  2. 2.
    A.V. Aho, 1990 Algorithms for finding patterns in strings, in Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Sc. Pub., pp. 256–300.Google Scholar
  3. 3.
    F. Baader, J.H. Siekmann, 1994. Unification Theory, in Handbook of Logic in Artif. Int. and Logic Prog., Vol. 2, (D. Gabbay et al, ed.), Clarendon Press, Oxford.Google Scholar
  4. 4.
    V.K. Bulitko, 1970. Equations and Inequalities in a Free Group and a Free Semigroup, Tul. Gos. Ped. Inst. Učen. Zap. Mat. Kafedr. Vyp. 2 Geometr. i Algebra (1970), 242–252.Google Scholar
  5. 5.
    J. Jaffar, 1990. Minimal and Complete Word Unification, Journal ACM, Vol. 37, No. 1, January 1990, pp.47–85.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    J.I. Hmelevskii, 1971. Equations in free semigroups, Trudy Mat. Inst. Steklov. 107 (1971). English translation: Proc. Steklov Inst. Math. 107 (1971).Google Scholar
  7. 7.
    A. Lentin, 1972. Equations in Free Monoids, in Automata Laguages and Programming (M. Nivat ed.), North Holland, 67–85.Google Scholar
  8. 8.
    G.S. Makanin, 1977. The problem of solvability of equations in a free semigroup, Math. USSR Sbornik 32(1977) (2), 129–198.zbMATHCrossRefGoogle Scholar
  9. 9.
    A. KoŚcielski, L. Pacholski, 1996. Complexity of Makanin's Algorithm, Journal of the ACM, Vol. 43, July 1996, pp. 670–684.CrossRefMathSciNetGoogle Scholar
  10. 10.
    J.P. Pécuchet, 1981. Equations avec constantes et algoritme de Makanin, Thèse de doctorat, Laboratoire d'informatique, Rouen.Google Scholar
  11. 11.
    G.D. Plotkin, 1972. Building-in equational theories, Mach. Int. 7, 1972, pp. 73–90.zbMATHMathSciNetGoogle Scholar
  12. 12.
    J. Siekmann, 1972. A modification of Robinson's Unification Procedure, M.Sc. Thesis.Google Scholar
  13. 13.
    K.U. Schulz, 1993. Word Unification and Transformation of Generalized Equations, Journal of Automated Reasoning 11: 149–184, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    K.U. Schulz, 1990. Makanin's Algorithm for Word Equations: two improvements and a generalization, in LNCS 572, pp. 85–150.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Claudio Gutiérrez
    • 1
  1. 1.Wesleyan UniversityMiddletownUSA

Personalised recommendations