Highly Influenced

# Satisfiability of Word Equations with Constants is in NEXPTIME

@inproceedings{Plandowski1999SatisfiabilityOW, title={Satisfiability of Word Equations with Constants is in NEXPTIME}, author={Wojciech Plandowski}, booktitle={STOC}, year={1999} }

- Published 1999 in STOC
DOI:10.1145/301250.301443

We prove that the length of a shortest solution of a word equation of length n can bounded by a double exponential function in n. This applied to the algorithm in [7] proves that the problem of solvability of word equations is in NEXPTIME. The best previously known bound for the problem was EXPSPACE 131.

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=301443.