A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
One of the most intrincate algorithms related to words is Makaninrsquos algorithm for solving word equations. Even if Makaninrsquos algorithm is very complicated, the solvability problem for word equations remains NPhard if one looks for short solutions, i. e. with length bounded by a linear function w. r. t. the size of the system () or even with constant bounded length (). Word equations can be used to define various properties of strings, e. g. characterization of imprimitiveness,doi:10.1007/978-3-540-28645-5_9 fatcat:6ri42pagcbeahmho7x7ruxguja