"Satisfiability of Word Equations with Constants is in NEXPTIME."

Wojciech Plandowski (1999)
a service of Schloss Dagstuhl - Leibniz Center for Informatics