Word problems on compressed words

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

Volumn 3142, Issue , 2004, Pages 906-918

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS;

CIRCUIT COMPLEXITY; COMPLEXITY CLASS; DETERMINISTIC-CONTEXT-FREE-LANGUAGES; MEMBERSHIP PROBLEM; MONOIDS; PSPACE-COMPLETE; STRAIGHT LINE PROGRAM; WORD PROBLEM;

CONTEXT FREE LANGUAGES;

EID: 33745148265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_76     Document Type: Article

References (28)

1. 1. J. Comput. Syst. Sci., 38:150-164, 1989.
2. 0 hierarchy. In Proc. STACS 98, LNCS 1373, pages 73-83. Springer, 1998.
3. G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Inf., 21:521-540, 1984.
4. M. Beaudry, M. Holzer, G. Niemann, and F. Otto. McNaughton families of languages. Theor. Comput. Sci., 290(3):1581-1628, 2003.
5. M. Beaudry, P. McKenzie, P. Péladeau, and D. Thérien. Finite monoids: From word to circuit evaluation. SIAM J. Comput., 26(1):138-152, 1997.
6. R. V. Book. Homogeneous Thue systems and the Church-Rosser property. Discrete Math., 48:137-145, 1984.
7. R. V. Book, M. Jantzen, B. Monien, C. P. Ó'Dúnlaing, and C. Wrathall. On the complexity of word problems in certain Thue systems. In Proc. MFCS'81, LNCS 118, pages 216-223. Springer, 1981.
8. R. V. Book and F. Otto. String-Rewriting Systems. Springer, 1993.
9. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Liempel-Ziv encoding (extended abstract). In Proc. SWAT 1996, LNCS 1097, pages 392-403. Springer, 1996.
10. M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Proc. FCT'93, LNCS 710, pages 299-308. Springer, 1993.
11. M. W. Krentel. The complexity of optimization problems. J. Comput. Syst. Sci., 36(3):490-509, 1988.
12. T. Lengauer and E. Wanke. The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems. J. Comput. Syst. Sci., 44:63-93, 1992.
13. P. M. Lewis II, R. E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In Proc. Sixth Annual IEEE Symp. on Switching Circuit Theory and Logic Design, pages 191-202, 1965.
14. R. J. Lipton and Y. Zalcstein. Word problems solvable in logspace. J. Assoc. Comput. Mach., 24(3):522-526, 1977.
15. M. Lohrey. Word problems and confluence problems for restricted semi-Thue systems. In Proc. RTA 2000, LNCS 1833, pages 172-186. Springer, 2000.
16. M. Lohrey. Word problems for 2-homogeneous monoids and symmetric logspace. In Proc. MFCS 2001, LNCS 2136, pages 500-511. Springer, 2001.
17. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
18. W. Plandowski. Testing equivalence of morphisms on context-free languages. In Proc. ESA'94, LNCS 855, pages 460-470. Springer, 1994.
19. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 262-272. Springer, 1999.
20. D. Robinson. Parallel Algorithms for Group Word Problems. PhD thesis, University of California, San Diego, 1993.
21. W. Rytter. Compressed and fully compressed pattern matching in one and two dimensions. Proc. IEEE, 88(11):1769-1778, 2000.
22. M. Sipser. Borel sets and circuit complexity. In Proc. STOC 1983, pages 61-69. ACM Press, 1983.
23. J. Stillwell. The word problem and the isomorphism problem for groups. Bull. Am. Math. Soc., New Ser., 6(1):33-56, 1982.
24. I. H. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comput. Mach., 25(3):405-414, 1978.
25. H. Veith. Succinct representation, leaf languages, and projection reductions. Inf. Control, 142(2):207-236, 1998.
26. K. W. Wagner. The complexity of combinatorial problems with succinct input representation. Acta Inf., 23(3):325-356, 1986.
27. Y. Zhang and R. Gupta. Path matching in compressed control flow traces. In Proc. DCC 2002, pages 132-141. IEEE Computer Society Press, 2002.
28. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. on Inf. Theory, 23(3):337-343, 1977.