Leaf languages and string compression

Information and Computation

Volumn 209, Issue 6, 2011, Pages 951-965

  Lohrey, Markus ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Complexity theory; Compressed string; Leaf languages; Straight line programs

Indexed keywords

COMPLEXITY THEORY; COMPRESSED STRING; EMBEDDING PROBLEMS; LEAF LANGUAGES; LEAF-LANGUAGE CLASS; LOGSPACE; MEMBERSHIP PROBLEM; POLYNOMIAL-TIME; PROBABILISTIC POLYNOMIAL TIME; STRAIGHT LINE PROGRAM; STRING COMPRESSION; VISIBLY PUSHDOWN LANGUAGES; XML LANGUAGES;

COMPUTATIONAL COMPLEXITY;

POLYNOMIAL APPROXIMATION;

EID: 79952581732     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2011.01.009     Document Type: Article

References (40)

1. R. Alur, and P. Madhusudan Visibly pushdown languages Proc. STOC 2004 2004 ACM Press 202 211
2. 1 J. Comput. Syst. Sci. 38 1989 150 164
3. M. Beaudry, P. McKenzie, P. Péladeau, and D. Thérien Finite monoids: from word to circuit evaluation SIAM J. Comput. 26 1 1997 138 152 (Pubitemid 127613083)
4. NP[log] subseteq PP, in: Proc. Structure in Complexity Theory Conference 1989, 1989, pp. 225-227. (Pubitemid 20607056)
5. J. Berstel, and L. Boasson Formal properties of XML grammars and languages Acta Inform. 38 9 2002 649 671
6. A. Bertoni, C. Choffrut, R. Radicioni, Literal shuffle of compressed words, in: Proc. IFIP TCS, Springer, 2008, pp. 87-100.
7. R.V. Book, and F. Otto String-Rewriting Systems 1993 Springer
8. B. Borchert, and A. Lozano Succinct circuit representations and leaf language classes are basically the same concept. Inform. Process. Lett. 59 4 1996 211 215 (Pubitemid 126392475)
9. D.P. Bovet, P. Crescenzi, and R. Silvestri A uniform approach to define complexity classes Theoret. Comput. Sci. 104 2 1992 263 283
10. 1 computation J. Comput. Syst. Sci. 57 2 1998 200 212
11. M. Charikar, E. Lehman, A. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat The smallest grammar problem IEEE Trans. Inform. Theor. 51 7 2005 2554 2576 (Pubitemid 41148951)
12. P.W. Dymond Input-driven languages are in log n depth Inform. Process. Lett. 26 5 1988 247 250
13. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman
14. L. Gasieniec, M. Karpinski, W. Plandowski, W. Rytter, Efficient algorithms for Lempel-Ziv encoding, in: Proc. SWAT 1996, LNCS, vol. 1097, Springer, 1996, pp. 392-403. (Pubitemid 126091945)
15. S. Greibach The hardest context-free language SIAM J. Comput. 2 4 1973 304 310
16. C. Hagenah, Gleichungen mit regulären Randbedingungen über freien Gruppen, Ph.D. thesis, University of Stuttgart, Institut für Informatik, 2000.
17. U. Hertrampf, The shapes of trees, in: Proc. COCOON 1997, LNCS, vol. 1276, Springer, 1997, pp. 412-421. (Pubitemid 127110307)
18. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proc. Eighth Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, 1993, pp. 200-207.
19. U. Hertrampf, H. Vollmer, and K.W. Wagner On balanced versus unbalanced computation trees Math. Syst. Theor. 29 4 1996 411 421
20. M. Holzer, and K.-J. Lange On the complexities of linear LL(1) and LR(1) grammars Proc. FCT 1993 LNCS vol. 710 1993 Springer 299 308
21. B. Jenner, P. McKenzie, and D. Thérien Logspace and logtime leaf languages Inform. Comput. 129 1 1996 21 33 (Pubitemid 126411508)
22. H.J. Karloff, and W.L. Ruzzo The iterated mod problem Inform. Comput. 80 3 1989 193 204
23. J. Kontinen, and H. Vollmer On second-order monadic monoidal and groupoidal quantifiers Logical Methods Comput. Sci. 6 3 2010
24. Y. Lifshits Processing compressed texts: a tractability border Proc. CPM 2007 LNCS vol. 4580 2007 Springer 228 240
25. Y. Lifshits, and M. Lohrey Querying and embedding compressed texts Proc. MFCS 2006 LNCS vol. 4162 2006 Springer 681 692 (Pubitemid 44577955)
26. M. Lohrey Word problems and membership problems on compressed words SIAM J. Comput. 35 5 2006 1210 1240 (Pubitemid 44599924)
27. M. Lohrey, Leaf languages and string compression, in: Proc. FSTTCS 2008, 2008, pp. 292-303.
28. M. Lohrey Compressed membership problems for regular expressions and hierarchical automata Int. J. Found.Comput. Sci. 21 5 2010 817 841
29. N. Markey, and P. Schnoebelen A PTIME - complete matching problem for SLP - compressed words Inform. Process. Lett. 90 1 2004 3 6
30. C.H. Papadimitriou Computational Complexity 1994 Addison Wesley
31. T. Peichl, and H. Vollmer Finite automata with generalized acceptance criteria Discrete Math. Theor. Comput. Sci. 4 2 2001 179 192
32. W. Plandowski Testing equivalence of morphisms on context-free languages Proc. ESA'94 LNCS vol. 855 1994 Springer 460 470
33. W. Plandowski, and W. Rytter Complexity of language recognition problems for compressed words J. Karhumäki, H.A. Maurer, G. Paun, G. Rozenberg, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa 1999 Springer 262 272
34. W. Rytter Application of Lempel-Ziv factorization to the approximation of grammar-based compression Theoret. Comput. Sci. 302 1-3 2003 211 222
35. S. Toda PP is as hard as the polynomial-time hierarchy SIAM J. Comput. 20 5 1991 865 877 (Pubitemid 21710211)
36. H. Veith Succinct representation, leaf languages, and projection reductions Inform. Comput. 142 2 1998 207 236 (Pubitemid 128451164)
37. N.K. Vereshchagin Relativizable and nonrelativizable theorems in the polynomial theory of algorithms Izv. Ross. Akad. Nauk Ser. Mat. 57 2 1993 51 90
38. H. Vollmer Introduction to Circuit Complexity 1999 Springer
39. B. von Braunmühl, and R. Verbeek Input-driven languages are recognized in log n space Proc. FCT 1983 LNCS vol. 158 1983 Springer 40 51
40. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Trans. Inform. Theor. 23 3 1977 337 343