Satisfiability of word equations with constants is in exponential space

In this paper we study solvability of equations over free semigroups, known as word equations, particularly G.S. Makanin's algorithm (1977), a general procedure to decide if a word equation has a solution. The upper bound time-complexity of Makanin's original decision procedure was quadruple exponential in the length of the equation, as shown by Jaffar. A. Koscielski and L. Pacholski (1996) reduced it to triple exponential, and conjectured that it could be brought down to double exponential. The present paper proves this conjecture. In fact we prove the stronger fact that its space-complexity is single exponential.