Abstract
One of the most intricate algorithms related to words is Makanin's algorithm solving word equations. The algorithm is very complicated and the complexity of the problem of solving word equations is not well understood. Word equations can be used to define various properties of strings, e.g. general versions of pattern-matching with variables. This paper is devoted to introduce a new approach and to study relations between Lempel-Ziv compressions and word equations. Instead of dealing with very long solutions we propose to deal with their Lempel-Ziv encodings. As our first main result we prove that each minimal solution of a word equation is highly compressible (exponentially compressible for long solutions) in terms of Lempel-Ziv encoding. A simple algorithm for solving word equations is derived. If the length of minimal solution is bounded by a singly exponential function (which is believed to be always true) then LZ encoding of each minimal solution is of a polynomial size (though the solution can be exponentially long) and solvability can be checked in nondeterministic polynomial time. As our second main result we prove that the solvability can be tested in polynomial deterministic time if the lengths of all variables are given in binary. We show also that lexicographically first solution for given lengths of variables is highly compressible in terms of Lempel-Ziv encodings.
On leave from Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland. Email:wojtekpl@mimuw.edu.pl. Partially supported by Academy of Finland under grant 14047.
Partially done while visiting University of Turku, Finland.
Preview
Unable to display preview. Download preview PDF.
References
Angluin D., Finding patterns common to a set of strings, J.C.S.S., 21(1), 46–62, 1980.
Choffrut, C., and Karhumäki, J., Combinatorics of words, in G.Rozenberg and A.Salomaa (eds), Handbook of Formal Languages, Springer, 1997.
Farah, M., Thorup M., String matching in Lempel-Ziv compressed strings, STOC'95, 703–712, 1995.
L. Gasieniec, M. Karpiński, W. Plandowski and W. Rytter, Randomized Efficient Algorithms for Compressed Strings: the finger-print approach, in proceedings of the CPM'96, LNCS 1075, 39–49, 1996.
Karhumäki J., Mignosi F., Plandowski W., The expressibility of languages and relations by word equations, in ICALP'97, LNCS 1256, 98–109, 1997.
Koscielski, A., and Pacholski, L., Complexity of Makanin's algorithm, J. ACM 43(4), 670–684, 1996.
A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans. on Inf. Theory, 22, 75–81, 1976.
Makanin, G.S., The problem of solvability of equations in a free semigroup, Mat. Sb., Vol. 103,(145), 147–233, 1977. English transl. in Math. U.S.S.R. Sb. Vol 32, 1977.
Miyazaki M., Shinohara A., Takeda M., An improved pattern matching algorithm for strings in terms of straight-line programs, in CPM'97, LNCS 1264, 1–11, 1997.
W. Plandowski, Testing equlity of morphisms on context-free languages, in ESA'94
Plandowski W., Rytter W., Application of Lempel-Ziv encodings to the solution of word equations, TUCS report, Turku Centre for Computer Science, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plandowski, W., Rytter, W. (1998). Application of Lempel-Ziv encodings to the solution of word equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055097
Download citation
DOI: https://doi.org/10.1007/BFb0055097
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive