Word problems and membership problems on compressed words

SIAM Journal on Computing

Volumn 35, Issue 5, 2006, Pages 1210-1240

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Complexity; Context free languages; Grammar based compression; Word problems for monoids

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; WORD PROCESSING;

CIRCUIT COMPLEXITY; COMPRESSED WORDS; MEMBERSHIP PROBLEMS; WORD PROBLEMS;

PROBLEM SOLVING;

EID: 33749260063     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445950     Document Type: Article

References (73)

1. F. AFRATI, H. LEISS, AND M. DE ROUGEMONT, Definability and compression, Fund. Inform., 56 (2003), pp. 155-180.
2. 1, J. Comput. System Sci., 38 (1989), pp. 150-164.
3. 1, J. Comput. System Sci., 41 (1990), pp. 274-306.
4. D. A. M. BARRINGTON, C.-J. LU, P. B. MILTERSEN, AND S. SKYUM, Searching constant width mazes captures the ACP hierarchy, in Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 98), Paris, France, Lecture Notes in Comput. Sci. 1373, M. Morvan, C. Meinel, and D. Krob, eds., Springer, Berlin, 1998, pp. 73-83.
5. G. BAUER AND F. OTTO, Finite complete rewriting systems and the complexity of the word problem, Acta Inform., 21 (1984), pp. 521-540.
6. M. BEAUDRY, M. HOLZER, G. NIEMANN, AND F. OTTO, McNaughton families of languages, Theoret. Comput. Sci., 290 (2003), pp. 1581-1628.
7. M. BEAUDRY, P. MCKENZIE, P. PÉLADEAU, AND D. THÉRIEN, Finite monoids: From word to circuit evaluation, SIAM J. Comput., 26 (1997), pp. 138-152.
8. P. BERMAN, M. KARPINSKI, L. L. LARMORE, W. PLANDOWSKI, AND W. RYTTER, On the complexity of pattern matching for highly compressed two-dimensional texts, J. Comput. System Sci., 65 (2002), pp. 332-350.
9. R. V. BOOK, Homogeneous Thue systems and the Church-Rosser property, Discrete Math., 48 (1984), pp. 137-145.
10. 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 Proceedings of the 10th International Symposium on Mathematical Foundations of Computer Science (MFCS'81), Štrbské Pleso, Czechoslovakia, Lecture Notes in Comput. Sci. 118, J. Gruska and M. Chytil, eds., Springer, Berlin, New York, 1981, pp. 216-223.
11. R. V. BOOK AND F. OTTO, String-Rewriting Systems, Springer, New York, 1993.
12. W. W. BOONE, The word problem, Ann. of Math. (2), 70 (1959), pp. 207-265.
13. B. BORCHERT AND A. LOZANO, Succinct circuit representations and leaf language classes are basically the same concept, Inform. Process. Lett., 59 (1996), pp. 211-215.
14. G. BUSATTO, M. LOHREY, AND S. MANETH, Efficient memory representation of XML documents, in Proceedings of the 10th International Symposium on Database Programming Languages (DBPL 2005), Trondheim, Norway, Lecture Notes in Comput. Sci. 3774, G. M. Bierman and Ch. Koch, eds., Springer, Berlin, 2005, pp. 199-216.
15. A. K. CHANDRA, D. C. KOZEN, AND L. J. STOCKMEYER, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114-133.
16. M. CHARIKAR, E. LEHMAN, D. LIU, R. PANIGRAHY, M. PRABHAKARAN, A. RASALA, A. SAHAI, AND A. SHELAT, Approximating the smallest grammar: Kolmogorov complexity in natural models, in Proceedings of the 34th Annual Symposium on Theory of Computing (STOC 2002), Montréal, Canada, ACM, New York, 2002, pp. 792-801.
17. S. A. COOK, A taxonomy of problems with fast parallel algorithms, Inform, and Control, 64 (1985), pp. 2-22.
18. S. A. COOK AND P. MCKENZIE, Problems complete for deterministic logarithmic space, J. Algorithms, 8 (1987), pp. 385-394.
19. M. FARACH AND M. THORUP, String matching in Lempel-Ziv compressed firings, Algorithmica, 20 (1998), pp. 388-404.
20. J. FEIGENBAUM, S. KANNAN, M. Y. VARDI, AND M. VISWANATHAN, The complexity of problems on graphs represented as OBDDs, Chicago J. Theoret. Comput. Sci., 1999, article 5.
21. H. GALPERIN AND A. WIGDERSON, Succinct representations of graphs, Inform, and Control, 56 (1983), pp. 183-198.
22. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
23. L. GASIENIEC, M. KARPINSKI, W. PLANDOWSKI, AND W. RYTTER, Efficient algorithms for Lempel-Ziv encoding (extended abstract), in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT 1996), Reykjavík, Iceland, Lecture Notes in Comput. Sci. 1097, R. G. Karlsson and A. Lingas, eds., Springer, Berlin, 1996, pp. 392-403.
24. B. GENEST AND A. MUSCHOLL, Pattern matching and membership for hierarchical message sequence charts, in Proceedings of the 5th Latin American Symposium on Theoretical Informatics (LATIN 2002), Cancun, Mexico, Lecture Notes in Comput. Sci. 2286, S. Rajsbaum, ed., Springer, Berlin, 2002, pp. 326-340.
25. L. M. GOLDSCHLAGER, The monotone and planar circuit value problems are log space complete for P, SIGACT News, 9 (1977), pp. 25-99.
26. L. M. GOLDSCHLAGER, e-productions in context-free grammars, Acta Inform., 16 (1981), pp. 303-308.
27. G. GOTTLOB, N. LEONE, AND F. SCARCELLO, Computing LOGCFL certificates, Theoret. Comput. Sci., 270 (2002), pp. 761-777.
28. R. GREENLAW, H. J. HOOVER, AND W. L. RUZZO, limits to Parallel Computation: P-Completeneas Theory, Oxford University Press, New York, 1995.
29. C. HAGENAH, Gleichungen mit regulären Randbedingungen über freien Gruppen, Ph.D. thesis, University of Stuttgart, Institut für Informatik, Stuttgart, Germany, 2000.
30. Y. HIRSHFELD, M. JERRUM, AND F. MOLLER, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Theoret. Comput. Sci., 158 (1996), pp. 143-159.
31. M. HOLZER AND K.-J. LANGE, On the complexities of linear LL(1) and LR(1) grammars, in Proceedings of the 9th International Symposium on Fundamentals of Computation Theory (FCT'93), Szeged, Hungary, Lecture Notes in Comput. Sci. 710, Z. Ésik, ed., Springer, Berlin, 1993, pp. 299-308.
32. N. IMMERMAN, Descriptive Complexity, Springer, New York, 1999.
33. M. JANTZEN, Confluent String Rewriting, EATCS Monogr. Theoret. Comput. Sci. 14, Springer, Berlin, 1988.
34. M. W. KRENTEL, The complexity of optimization problems, J. Comput. System Sci., 36 (1988), pp. 490-509.
35. K.-J. LANGE AND P. MCKBNZIE, On the complexity of free monoid morphisms, in Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98), Taejon, Korea, Lecture Notes in Comput. Sci. 1533, K.-Y. Chwa and O. H. Ibarra, eds., Springer, Berlin, 1998, pp. 247-256.
36. J. LARUS, Whole program paths, in Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), ACM, New York, 1999, pp. 259-269.
37. E. LEHMAN AND A. SHELAT, Approximation algorithms for grammar-based compression, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), San Francisco, 2002, pp. 205-212.
38. T. LENGAUER AND K. W. WAGNER, The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems, J. Comput. System Sci., 44 (1992), pp. 63-93.
39. P. M. LEWIS II, R. E. STEARNS, AND J. HARTMANIS, Memory bounds for recognition of context-free and context-sensitive languages, in Proceedings of the Sixth Annual IEEE Symposium on Switching Circuit Theory and Logic Design, 1965, pp. 191-202.
40. R. J. LIPTON AND Y. ZALCSTEIN, Word problems solvable in logspace, J. Assoc. Comput. Mach., 24 (1977), pp. 522-526.
41. M. LOHREY, Word problems and confluence problems for restricted semi-Thue systems, in Proceedings of the 11th International Conference on Rewrite Techniques and Applications (RTA 2000), Norwich, UK, Lecture Notes in Comput. Sci. 1833, L. Bachmair, ed., Springer, Berlin, 2000, pp. 172-186.
42. M. LOHREY, Word problems for 2-homogeneous monoids and symmetric logspace, in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Marianske Lazne, Czech Republic, Lecture Notes in Comput. Sci. 2136, J. Sgall, A. Pultr, and P. Kolman, eds. Springer, Berlin, 2001, pp. 500-511.
43. M. LOHREY, Word problems on compressed word, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Turku, Finland, Lecture Notes in Comput. Sci. 3142, J. Diaz, J. Karhumäki, A. Lepistö, and D. Sannella, eds., Springer, Berlin, 2004, pp. 906-918.
44. M. LOHREY, Model-checking hierarchical structures, in Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), Chicago, IL, IEEE Computer Society Press, Los Alamitos, CA, 2005, pp. 168-177.
45. M. LOHREY AND S. MANETH, Tree automata and XPath on compressed trees, in Proceedings of the Tenth International Conference on Implementation and Application of Automata (CIAA 2005), Sophia Antipolis, France, Lecture Notes in Comput. Sci. 3845, J. Farré, I. Litovsky, and S. Schmitz, eds., Springer, Berlin, 2006, pp. 227-240.
46. S. MANETH AND G. BUSATTO, Tree transducers and tree compressions, in Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2004), Barcelona, Spain, Lecture Notes in Computer Sci. 2987, I. Walukiewicz, ed., Springer, Berlin, 2004, pp. 363-377.
47. A. MARKOV, The impossibility of certain algorithms in the theory of associative systems, Doklady Akad. Nauk SSSR (N.S.), 58 (1947), pp. 353-356.
48. P. MCKENZIE AND K. W. WAGNER, The complexity of membership problems for circuits over sets of natural numbers, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), Berlin, Germany, Lecture Notes in Comput. Sci. 2607, H. Alt and M. Habib, eds., Springer, Berlin, 2003, pp. 571-582.
49. M. MIYAZAKI, A. SHINOHARA, AND M. TAKEDA, An improved pattern matching algorithm for strings in terms of straight-line programs, in Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97), Aarhus, Denmark, Lecture Notes in Comput. Sci., A. Apostolico and J. Hein, eds., Springer, Berlin, 1997, pp. 1-11.
50. M.-J. NEDERHOF AND G. SATTA, The language intersection problem for nonrecursive context-free grammars, Inform, and Comput., 192 (2004), pp. 172-184.
51. P. S. NOVIKOV, On the Algorithmic Unsolvability of the Word Problem in Group Theory, Amer. Math. Soc. Transl. Ser. 2 9, AMS, Providence, RI, 1958, pp. 1-122.
52. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
53. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, A note on succinct representations of graphs, Inform, and Control, 71 (1986), pp. 181-185.
54. W. PLANDOWSKI, Testing equivalence of morphisms on context-free languages, in Proceedings of the Second Annual European Symposium on Algorithms (ESA'94), Utrecht, The Nether lands, Lecture Notes in Comput. Sci. 855, J. van Leeuwen, ed., Springer, Berlin, 1994. pp. 460-470.
55. 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, J. Karhumäki, H. A. Maurer, G. Paun, and G. Rozenberg, eds., Springer, Berlin, 1999, pp. 262-272.
56. E. POST, Recursive unsolvability of a problem of Thue, J. Symbolic Logic, 12 (1947), pp. 1-11.
57. D. ROBINSON, Parallel Algorithms for Group Word Problems, Ph.D. thesis, University of California, San Diego, CA, 1993.
58. W. L. RUZZO, On uniform circuit complexity, J. Comput. System Sci., 22 (1981), pp. 365-383.
59. W. RYTTER, Algorithms on compressed strings and arrays, in Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'99, Theory and Practice of Informatics), Milovy, Czech Republic, Lecture Notes in Comput. Sci. 1725, J. Pavelka, G. Tel, and M. Bartosek, eds., Springer, Berlin, 1999, pp. 48-65.
60. W. RYTTER, Compressed and fully compressed pattern matching in one and two dimensions, Proceedings of the IEEE, 88 (2000), pp. 1769-1778.
61. W. RYTTER, Application of Lempel-Ziv factorization to the approximation of grammar-based compression, Theoret. Comput. Sci., 302 (2003), pp. 211-222.
62. W. RYTTER, Grammar compression, LZ-encodings, and string algorithms with implicit input, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Turku, Finland, Lecture Notes in Comput. Sci. 3142, J. Diaz, J. Karhumäki, A. Lepistö, and D. Sannella, eds., Springer, Berlin, 2004, pp. 15-27.
63. M. SIPSER, Borel sets and circuit complexity, in Proceedings of the 15th Annual Symposium on Theory of Computing (STOC 1983), ACM, New York, 1983, pp. 61-69.
64. L. J. STOCKMEYER, The polynomial-time hierarchy, Theoret. Comput. Sci., 3 (1976), pp. 1-22.
65. I. H. SUDBOROUGH, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach., 25 (1978), pp. 405-414.
66. H. VEITH, Languages represented by Boolean formulas, Inform. Process. Lett., 63 (1997), pp. 251-256.
67. H. VEITH, How to encode a logical structure by an OBDD, in Proceedings of the 13th Annual IEEE Conference on Computational Complexity (CoCo 1998), Buffalo, NY, IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 122-131.
68. H. VEITH, Succinct representation, leaf languages, and projection reductions, Inform, and Comput., 142 (1998), pp. 207-236.
69. K. W. WAGNER, The complexity of combinatorial problems with succinct input representation, Acta Inform., 23 (1986), pp. 325-356.
70. C. WRATHALL, Complete sets and the polynomial-time hierarchy, Theoret. Comput. Sci., 3 (1976), pp. 23-33.
71. K. YAMAGATA, T. UCHIDA, T. SHOUDAI, AND Y. NAKAMURA, An effective grammar-based compression algorithm for tree structured data, in Proceedings of the 13th International Conference on Inductive Logic Programming (ILP 2003), Szeged, Hungary, Lecture Notes in Artificial Intelligence 2835, T. Horváth, ed., Springer, Berlin, 2003, pp. 383-400.
72. Y. ZHANG AND R. GUPTA, Path matching in compressed control flow traces, in Proceedings of the 12th Data Compression Conference (DCC 2002), Snowbird, UT, IEEE Computer Society Press, Los Alamitos, CA, 2002, pp. 132-141.
73. J. ZIV AND A. LEMPEL, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory, 23 (1977), pp 337-343.