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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call