A PTIME-complete matching problem for SLP-compressed words

Information Processing Letters

Volumn 90, Issue 1, 2004, Pages 3-6

  Markey, N ^a,b   Schnoebelen, Ph ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b CNRS   (France)

Author keywords

Algorithms; Complexity; Compressed strings; Pattern matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING; DATA STRUCTURES; DECISION MAKING; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

COMPRESSED STRINGS; STRAIGHT-LINE PROGRAMS;

DATA COMPRESSION;

EID: 1442356676     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.01.002     Document Type: Article

References (12)

1. Beaudry M., McKenzie P., Péladeau P., Thérien D. Finite monoids: From word to circuit evaluation. SIAM J. Comput. 26:(1):1997;138-152.
2. Cook S.A. Characterizations of pushdown machines in terms of time-bounded computers. J. ACM. 18:(1):1971;4-18.
3. De Agostino S. P-complete problems in data compression. Theoret. Comput. Sci. 127:(1):1994;181-186.
4. Ga̧sieniec L., Gibbons A., Rytter W. Efficiency of fast parallel pattern-searching in highly compressed texts. Proc. 24th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'99), Szklarska Poreba, Poland, September 1999. Lecture Notes in Comput. Sci. vol. 1672:1999;48-58 Springer, Berlin.
5. Ga̧sieniec L., Karpinski M., Plandowski W., Rytter W. Efficient algorithms for Lempel-Ziv encoding. Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), Reykjavík, Iceland, July 1996. Lecture Notes in Comput. Sci. vol. 1097:1996;392-403 Springer, Berlin.
6. Ga̧sieniec L., Rytter W. Almost optimal fully LZW-compressed pattern matching. Proc. Data Compression Conference (DCC'99), March 1999, Snowbird, UT, USA. 1999;316-325 IEEE Comp. Soc. Press.
7. Greenlaw R., Hoover H.J., Ruzzo W.L. Limits to Parallel Computation: P-Completeness Theory. 1995;Oxford Univ. Press.
8. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science. vol. A:1990;67-161 Elsevier Science. chapter 2.
9. Plandowski W., Rytter W. Complexity of language recognition problems for compressed words. Karhumaki J., Maurer H., Paun G., Rozenberg G. Jewels are Forever. 1999;262-272 Springer, Berlin.
10. Rytter W. Algorithms on compressed strings and arrays. Proc. 26th Conf. Current Trends in Theory and Practice of Informatics (SOFSEM'99), Milovy, Czech Republic, November 1999. Lecture Notes in Comput. Sci. vol. 1725:1999;48-65 Springer, Berlin.
11. Storer J.A., Szymanski T.G. Data compression via textual substitution. J. ACM. 29:(4):1983;928-951.
12. Sudborough I.H. On the tape complexity of deterministic context-free languages. J. ACM. 25:(3):1978;405-414.