Skip to main content

Word equations with two variables

  • Conference paper
  • First Online:
Word Equations and Related Topics (IWWERT 1991)

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

Included in the following conference series:

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

Access this chapter

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. Ph.D. Thesis, Université de Rouen, 1987.

    Google Scholar 

  2. H. Abdulrab, J.P. Pecuchet, Solving word equations. Journal of Symbolic Computation 8 (1989), pp. 499–521.

    Google Scholar 

  3. S.I. Adyan, G.S. Makanin, Investigation on algorithmic questions of algebra. Trudy Matem. Inst. Steklova 168 (1984), English translation in Proc. of Steklov Institute of Mathematics 1986, issue 3, pp. 207–226.

    Google Scholar 

  4. V.K. Bulitko, Equations and inequalities in a free group and a free semigroup. (in Russian) Tul. Gos. Ped. Inst. Ucen. Zap. Mat. Kafedr Vyp 2, Geometr. i Algebra. (1970), pp.242–252.

    Google Scholar 

  5. W. Charatonik, Equations in Free Semigroup (in Polish), Master Thesis, Wrocław University 1991 (unpublished).

    Google Scholar 

  6. J. Jaffar, Minimal and Complete Word Unification. Journal of ACM 37 (1990), pp. 47–85.

    Google Scholar 

  7. Yu.I. Khmelevskii, Solution of word equations in three unknowns. Dokl. Akad. Nauk SSSR 177 (1967), 1023–1025; English transl. in Soviet Math. Dokl. 8 (1967).

    Google Scholar 

  8. Yu.I. Khmelevskii, Equations in a Free Semigroup (in Russian), Trudy Matern. Inst. Steklova, 107 (1971) pp. 1–284.

    Google Scholar 

  9. A. KoŚcielski, L. Pacholski, Complexity of Unification in Free Groups and Free Semigroups, Proceedings 31st Annual Symposium on Foundations of Computer Science, Los Alamitos 1990, vol. II, pp. 824–830.

    Google Scholar 

  10. A. KoŚcielski, L. Pacholski, Complexity of Makanins' Algorithms submitted.

    Google Scholar 

  11. A. Lentin, Equations in free monoids. in Nivat, editor, Automata, Languages and Programing, Amsterdam 1972, pp. 67–85.

    Google Scholar 

  12. G.S. Makanin, The Problem of Solvability of Equations in a Free Semigroup. (in Russian), Matematicheskii Sbornik 103 (1977), pp. 147–236; English translation in Math. USSR Sbornik 32 (1977), pp. 129–198.

    Google Scholar 

  13. J.-P. Pecuchet, Solutions principales et rang d'un système d'équations avec constantes dans le monoÏde libre. Discrete Mathematics 48 (1984), pp. 253–274.

    Google Scholar 

  14. G. Plotkin, Building in equational theories. Machine Intelligence 7 (1972), pp. 73–90.

    Google Scholar 

  15. K.U. Schulz, Makanin's algorithm — two improvements and a generalization, CIS-report 91-39, Centrum für Informations-und Sprachverarbeitung, University of Munique, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Habib Abdulrab Jean-Pierre Pécuchet

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Charatonik, W., Pacholski, L. (1993). Word equations with two variables. In: Abdulrab, H., Pécuchet, JP. (eds) Word Equations and Related Topics. IWWERT 1991. Lecture Notes in Computer Science, vol 677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56730-5_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-56730-5_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56730-1

  • Online ISBN: 978-3-540-47636-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics