Skip to main content
SpringerLink
Log in

Word unification and transformation of generalized equations

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Makanin's algorithm shows that it is decidable whether a word equation has a solution. The original description was hard to understand and not designed for implementation. Since words represent a fundamental data type, various authors have given improved descriptions. In this paper we present a version of the algorithm that probably cannot be further simplified without fundamentally new insights that exceed Makanin's original ideas. We give a transformation that is efficient and conceptually simple and applies to arbitrary generalized equations. No further subprocedure is needed for the generation of the search tree. Particular attention is then given to the proof that proper generalized equations are transformed into proper generalized equations. This point, which is important for the termination argument, was treated erroneously in other papers. We also show that a combination of the basic algorithm for string-unification and Makanin's algorithm offers a simple solution to the problem of terminating minimal and complete word unification.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulrab, H., ‘Résolution d'équations sur les mots: Etude et implémentation LISP de l'algorithme de Makanin’, Thèse de doctorat, Laboratoire d'informatique, Rouen, 1987.

    Google Scholar 

  2. Abdulrab H. and Pécuchet, J.-P., ‘Solving word equations’,J. Symbolic Computation,8, 499–521 (1989).

    Google Scholar 

  3. Aho, A. V., ‘Agorithms for finding patterns in strings’, inHandbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers, pp. 256–300, 1990.

  4. Baader, F., ‘Unification theory’,Proceedings First International Workshop on Word Equations and Related Topics, IWWERT '90 (K. U. Schulz, ed.), Tübingen, Springer,LNCS 572, 1990.

    Google Scholar 

  5. Bulitko, V. K., ‘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 242–252, 1970 (Russian) (MR52# 14045).

  6. Colmerauer, A., ‘Final specification for Prolog III’,ESPRIT Ref. No. P1219 1106, 1988.

  7. Cooper, D. C., ‘Theorem proving in arithmetic without multiplicàtion’,Machine Intelligence,7, 82–95 (1972).

    Google Scholar 

  8. Hmelevskii, J. I., ‘Equations in free semigroups’,Trudy Mat. Inst. Steklov,107 (1971); English translation:Proc. Steklov Inst. of Mathematics,107 (1971).

  9. Jaffar, J., ‘Minimal and complete word unification’,J. ACM,37(1), 47–85 (1990).

    Google Scholar 

  10. Kościelski, A. and Pacholski, L., ‘Complexity of Makanin's algorithms’,Research Report, University of Wroclaw (1991); preliminary version: ‘Complexity of unification in free groups and free semigroups’,Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, Los Alamos, pp. 824–829, 1990.

  11. Lentin, A., ‘Equations in free monoids’, inAutomata Languages and Programming (M. Nivat, ed.), North Holland Publishers, Amsterdam, pp. 67–85, 1972.

    Google Scholar 

  12. Lentin, A. and Schützenberger, M. P., ‘A combinatorial problem in the theory of free monoids’, inProceedings of the University of North Carolina, 128–144 (1967).

  13. Livesey, M. and Siekmann, J., ‘Termination and decidability results for string unification’, Research paper, Essex University, 1975.

  14. Makanin, G. S., ‘The problem of solvability of equations in a free semigroup’,Math. USSR Sbornik 32(2), 129–198 (1977).

    Google Scholar 

  15. Makanin, G. S., ‘Recognition of the rank of equations in a free semigroup’,Math. USSR Izvestija 14(3), 499–545 (1980).

    Google Scholar 

  16. Makanin, G. S., ‘Equations in a free semigroup’,Amer. Math. Soc. Transl. (2),117, 1–6 (1981).

    Google Scholar 

  17. Pécuchet, J. P., ‘Equations avec constantes et algorithme de Makanin’, Thèse de doctorat, Laboratoire d'informatique, Rouen, 1981.

    Google Scholar 

  18. Plotkin, G., ‘Building-in equational theories’,Machine Intelligence 7, 73–90 (1972).

    Google Scholar 

  19. Schulz, K. U., ‘Makanin's algorithm — two improvements and a generalization’, Habilitationsschrift,CIS-Report 91-39, University of Munich. Also inProceedings of the First International Workshop on Word Equations and Related Topics, IWWERT '90, Tübingen, Springer,LNCS 572, 1990.

  20. Siekmann, J., ‘String-unification’,Research Paper, Essex University, March, 1975.

  21. Siekmann, J., ‘Unification and matching problems’,Ph.D. Thesis, Essex University, Memo CSA-4-78, 1978.

  22. Siekmann, J., ‘Unification theory: A survey’, in Special Issue on Unification,Journal of Symbolic Computation (C. Kirchner, ed.),7, 315–337 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIS, University of Munich, Leopoldstr. 139, D-8000, Munich 40, Germany

    Klaus U. Schulz

Authors
  1. Klaus U. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schulz, K.U. Word unification and transformation of generalized equations. J Autom Reasoning 11, 149–184 (1993). https://doi.org/10.1007/BF00881904

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881904

Key words

Search

Navigation