Leaf languages and string compression

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 2, Issue , 2008, Pages 292-303

  Lohrey, Markus ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Complexity theory; Grammar based compression; Leaf languages; String compression

Indexed keywords

COMPLEXITY THEORY; GRAMMAR-BASED COMPRESSION; LEAF LANGUAGES; LEAF-LANGUAGE CLASS; MEMBERSHIP PROBLEM; STRAIGHT LINE PROGRAM; STRING COMPRESSION; VISIBLY PUSHDOWN LANGUAGES;

POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

DATA COMPRESSION;

EID: 84880207143     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. R. Alur and P. Madhusudan. Visibly pushdown languages. In Proc. STOC 2004, 202-211. ACM Press, 2004.
2. 1. J. Comput. System Sci., 38: 150-164, 1989.
3. 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.
4. J. Berstel and L. Boasson. Formal properties of XML grammars and languages. Acta Inform., 38(9): 649-671, 2002.
5. A. Bertoni, C. Choffrut, and R. Radicioni. Literal shuffle of compressed words. In Proc. IFIP TCS 2008, 87-100. Springer, 2008.
6. B. Borchert and A. Lozano. Succinct circuit representations and leaf language classes are basically the same concept. Inform. Process. Lett., 59(4): 211-215, 1996.
7. D. P. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoret. Comput. Sci., 104(2): 263-283, 1992.
8. 1 computation. J. Comput. System Sci., 57(2): 200-212, 1998.
9. P. W. Dymond. Input-driven languages are in log n depth. Inform. Process. Lett., 26(5): 247-250, 1988.
10. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. In Proc. SWAT 1996, LNCS 1097, 392-403. Springer, 1996.
11. S. Greibach. The hardest context-free language. SIAM J. Comput., 2(4): 304-310, 1973.
12. C. Hagenah. Gleichungen mit regulä ren Randbedingungen über freien Gruppen. PhD thesis, University of Stuttgart, Institut für Informatik, 2000.
13. U. Hertrampf. The shapes of trees. In Proc. COCOON 1997, LNCS 1276, 412-421. Springer, 1997.
14. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, and K. W. Wagner. On the power of polynomial time bit-reductions. In Proc. Eighth Annual Structure in Complexity Theory Conference, 200-207. IEEE Computer Society Press, 1993.
15. M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Proc. FCT 1993, LNCS 710, 299-308. Springer, 1993.
16. B. Jenner, P. McKenzie, and D. Thérien. Logspace and logtime leaf languages. Inform. and Comput., 129(1): 21-33, 1996.
17. H. J. Karloff and W. L. Ruzzo. The iterated mod problem. Inform. and Comput., 80(3): 193-204, 1989.
18. Y. Lifshits and M. Lohrey. Querying and embedding compressed texts. In Proc. MFCS 2006, LNCS 4162, 681-692. Springer, 2006.
19. M. Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35(5): 1210-1240, 2006.
20. N. Markey and P. Schnoebelen. A PTIME-complete matching problem for SLP-compressed words. Inform. Process. Lett., 90(1): 3-6, 2004.
21. T. Peichl and H. Vollmer. Finite automata with generalized acceptance criteria. Discrete Math. Theor. Comput. Sci., 4(2): 179-192 (electronic), 2001.
22. W. Plandowski. Testing equivalence of morphisms on context-free languages. In Proc. ESA'94, LNCS 855, 460-470. Springer, 1994.
23. W. Plandowski and W. Rytter. Complexity of language recognition problems for compressed words. In J. Karhumäki, H. A. Maurer, G. Paun, and G. Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, 262-272. Springer, 1999.
24. H. Veith. Succinct representation, leaf languages, and projection reductions. Inform. and Comput., 142(2): 207-236, 1998.
25. N. K. Vereshchagin. Relativizable and nonrelativizable theorems in the polynomial theory of algorithms. Izv. Ross. Akad. Nauk Ser. Mat., 57(2): 51-90, 1993.
26. H. Vollmer. Introduction to Circuit Complexity. Springer, 1999.
27. B. von Braunmühl and R. Verbeek. Input-driven languages are recognized in log n space. In Proc. FCT 1983, LNCS 158, 40-51. Springer, 1983.