Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) (1998)

Palo Alto, California

Nov. 8, 1998 to Nov. 11, 1998

ISSN: 0272-5428

ISBN: 0-8186-9172-7

pp: 112

Claudio Gutiérrez , Wesleyan University

ABSTRACT

In this paper we study solvability of equations over free semigroups, known as word equations, particularly Makanin's algorithm, a general procedure to decide if a word equation has a solution. The upper bound time-complexity of Makanin's original decision procedure (1977) was quadruple exponential in the length of the equation, as shown by Jaffar. In 1990 Ko\'scielski and Pacholski 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.

INDEX TERMS

Makanin's algorithm, word equations, word combinatorics, free semigroups, unification, algorithms

CITATION

C. Gutiérrez, "Satisfiability of Word Equations with Constants is in Exponential Space,"

*Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)(FOCS)*, Palo Alto, California, 1998, pp. 112.

doi:10.1109/SFCS.1998.743434

CITATIONS