Skip to main content
SpringerLink
Log in

On word equations and Makanin's algorithm

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 380))

Included in the following conference series:

  • 174 Accesses

Abstract

We give a short survey of major results and algorithms in the field of solving word equations, and describe the central algorithm of Makanin.

This work was also supported by the Greco de Programmation du CNRS and the PRC Programmation Avancée et Outils pour l'Intelligence Artificielle.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Abdulrab: Résolution d'équations sur les mots: étude et implémentation LISP de l'algorithme de Makanin. (Thèse), University of Rouen (1987). And Rapport LITP 87-25, University of Paris-7 (1987).

    Google Scholar 

  2. H. Abdulrab: Solving word equations. to appear in RAIRO d'Informatique théorique.

    Google Scholar 

  3. M.H. Albert, J. Lawrence: A proof of Ehrenfeucht's conjecture. Theoretical Computer Science 41 p. 121–123, (1985).

    Article  Google Scholar 

  4. F. Fages, G. Huet: Complete sets of unifiers and matchers in equational theories. Theoretical Computer Science, 43, p. 189–200, (1986).

    Article  Google Scholar 

  5. Yu. I. Hmelevskii: Equations in free Semigroups. Trudy Mat. In st. Steklov, 107, (1971).

    Google Scholar 

  6. C. Kirchner: From unification in combination of equational theories to a new AC-Unification algorithm. Proc. of the CREAS, Austin, Texas. (1987).

    Google Scholar 

  7. A. Lentin: Équations dans le monoïde libre, Gauthier-Villars, Paris, (1972).

    Google Scholar 

  8. A. Lentin, M.P. Schutzenberger: A combinatorial problem in the theory of free monoids. Proc. of the University of north-Carolina, p. 128–144, (1967).

    Google Scholar 

  9. G.S. Makanin: The problem of solvability of equations in a free semigroup. Mat. Sb. 103(145) (1977) p. 147–236 English transl. in Math. USSR Sb. 32, (1977).

    Google Scholar 

  10. G.S. Makanin: Equations in a free group. Math. USSR Izvestiya Vol. 21, No 3, (1983).

    Google Scholar 

  11. J.P. Pécuchet: Équations avec constantes et algorithme de Makanin. (Thèse), University of Rouen, (1981).

    Google Scholar 

  12. G. Plotkin: Building-in equational theories. Machine Intelligence 7, p. 73–90, (1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique de Rouen et LITP. Faculté des Sciences, B.P. 118, 76134, Mont-Saint-Aignan Cedex

    Habib Abdulrab & Jean-Pierre Pécuchet

Authors
  1. Habib Abdulrab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Pierre Pécuchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdulrab, H., Pécuchet, JP. (1989). On word equations and Makanin's algorithm. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation