Skip to main content
SpringerLink
Log in

An analysis of Makanin's algorithm deciding solvability of equations in free groups

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

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

Included in the following conference series:

Abstract

We give slightly simplified version of the proof of Makanin's theorem on decidability of solvability problem for equations in free groups. We also provide an analysis of the Makanin's proof and point out why the estimates on the complexity of Makanin's algorithm and on the length of a minimal solution of an equation in a free group are not primitive recursive.

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. J. Jaffar, Minimal and Complete Word Unification, Journal of the Association for Computing Machinery, 37, 1(1990), pp. 47–85.

    Google Scholar 

  2. A. Kościelski, L. Pacholski, Complexity of Unification in Free Groups and Free Semi-Groups, Proceedings 31st Annual Symposium on Foundations of Computer Science, v. II, (1990), pp. 824–829.

    Google Scholar 

  3. A. Kościelski, L. Pacholski, Is Makanin's Algorithm Deciding Solvability of Equations in Free Groups Primitive Recursive?.

    Google Scholar 

  4. A. Kościelski, L. Pacholski, On the Exponent of Periodicity of a Minimal Solution of a Word Equation.

    Google Scholar 

  5. G. S. Makanin, The problem of solvability of equations in a free semigroup, Matematiceskii Sbornik, 103, 2(1977), pp. 147–236 (in Russian), English translation in Math. USSR Sbornik, 32, 2(1977), pp. 129–198.

    Google Scholar 

  6. G. S. Makanin, Equations in a free group, Izviestiya AN SSSR, 46(1982), pp. 1199–1273 (in Russian), English translation in Math. USSR Izv. 21(1983).

    Google Scholar 

  7. G. S. Makanin, Decidability of the universal and the positive theories of a free group, Izviestiya AN SSSR, 48, 4(1984), pp. 735–749 (inRussian), English translation in Math. USSR Izv., 25(1985).

    Google Scholar 

  8. A. A. Razborov, On systems of equations in a free group, Izviestiya AN SSSR, 48(1984), pp 779–832 (in Russian), English translation in Math. USSR Izv., 25(1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, ul. Przesmyckiego 20, 51-151, Wrocław

    Antoni Kościelski

Authors
  1. Antoni Kościelski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. U. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kościelski, A. (1992). An analysis of Makanin's algorithm deciding solvability of equations in free groups. In: Schulz, K.U. (eds) Word Equations and Related Topics. IWWERT 1990. Lecture Notes in Computer Science, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55124-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-55124-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55124-9

  • Online ISBN: 978-3-540-46737-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation