Application of lempel-ziv encodings to the solution of word equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 731-742

  Plandowski, Wojciech ^a   Rytter, Wojciech ^b,c  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; EXPONENTIAL FUNCTIONS; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; SIGNAL ENCODING;

ENCODINGS; GENERAL VERSION; MINIMAL SOLUTIONS; NEW APPROACHES; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL SIZE; SIMPLE ALGORITHM; WORD EQUATIONS;

ENCODING (SYMBOLS);

EID: 84878620266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055097     Document Type: Conference Paper

References (12)

1. Angluin D., Finding patterns common to a set of strings, J.C.S.S., 21(1), 46-62, 1980.
2. Choffrut, C, and Karhumäki, J., Combinatorics of words, in G. Rozenberg and A. Salomaa (eds), Handbook of Formal Languages, Springer, 1997.
3. Farah, M., Thorup M., String matching in Lempel-Ziv compressed strings, STOC'95, 703-712, 1995.
4. L. Gasieniec, M. Karpinski, 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.
5. Karhumäki J., Mignosi F., Plandowski W., The expressibility of languages and relations by word equations, in ICALP'97, LNCS 1256, 98-109, 1997.
6. Koscielski, A., and Pacholski, L., Complexity of Makanin's algorithm, J. ACM 43(4), 670-684, 1996.
7. A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans, on Inf. Theory, 22, 75-81, 1976.
8. Makanin, G.S., The problem of solvability of equations in a free semigroup, Mat. Sb., Vol. 103, (145), 147-233, 1977.
9. English transl, in Math. U.S.S.R. Sb. vol 32, 1977.
10. 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.
11. W. Plandowski, Testing equlity of morphisms on context-free languages, in ESA'94
12. Plandowski W., Rytter W., Application of Lempel-Ziv encodings to the solution of word equations, TUCS report, Turku Centre for Computer Science, 1998.