Compressed membership problems for regular expressions and hierarchical automata

International Journal of Foundations of Computer Science

Volumn 21, Issue 5, 2010, Pages 817-841

  Lohrey, Markus ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Algorithms on compressed strings; regular expressions; straight line programs

Indexed keywords

EID: 77957801579     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905411000757X     Document Type: Conference Paper

References (26)

1. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst., 23 (3):273-303, 2001.
2. G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Inf., 21:521-540, 1984.
3. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. Assoc. Comput. Mach., 28 (1):114-133, 1981.
4. K. J. Compton and C. W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Ann. Pure Appl. Logic, 48:1-79, 1990.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
6. B. Genest and A. Muscholl. Pattern matching and membership for hierarchical message sequence charts. Theory Comput. Syst., 42 (4):536-567, 2008.
7. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
8. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoret. Comput. Sci., 158 (1 & 2):143-159, 1996.
9. B. Jenner. Knapsack problems for NL. Inform. Process. Lett., 54 (3):169-174, 1995.
10. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. Inform. Process. Lett., 40 (1):25-31, 1991.
11. D. Kozen. Lower bounds for natural proof systems. In Proc. FOCS 77, pages 254-266. IEEE Computer Society Press, 1977.
12. Y. Lifshits and M. Lohrey. Querying and embedding compressed texts. In Proc. MFCS 2006, LNCS 4162, pages 681-692. Springer, 2006.
13. M. Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35 (5):1210-1240, 2006.
14. M. Lohrey. Model-checking hierarchical structures. To appear in J. Comput. System Sci., 2008. A preliminary version appeared in Proc. LICS 2005, pages 168-177. IEEE Computer Society Press, 2005.
15. M. Lohrey. Leaf languages and string compression. In Proc. FSTTCS 2008, pages 292-303, 2008.
16. N. Markey and P. Schnoebelen. Model checking a path. In Proc. CONCUR 2003, LNCS 2761, pages 248-262. Springer, 2003.
17. N. Markey and P. Schnoebelen. A PTIME-complete matching problem for SLP-compressed words. Inform. Process. Lett., 90 (1):3-6, 2004.
18. A. J. Mayer and L. J. Stockmeyer. The complexity of word problems-this time with interleaving. Inform. and Comput., 115 (2):293-311, 1994.
19. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
20. H. Petersen. Decision problems for generalized regular expressions. Proc. of DCAGRS 2000, pages 22-29, 2000.
21. H. Petersen. The membership problem for regular expressions with intersection is complete in LOGCFL. In Proc. STACS 2002, LNCS 2285, pages 513-522. Springer, 2002.
22. W. Plandowski. Testing equivalence of morphisms on context-free languages. In Proc. ESA'94, LNCS 855, pages 460-470. Springer, 1994.
23. 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.
24. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time (preliminary report). In Proc. STOCS 73, pages 1-9. ACM Press, 1973.
25. M. K. Warmuth and D. Haussler. On the complexity of iterated shuffle. J. Comput. System Sci., 28 (3):345-358, 1984.
26. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Information Theory, 23 (3):337-343, 1977.