Compressed membership for NFA (DFA) with compressed labels is in NP (P)

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 136-147

  Jez, Artur ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Algorithms for compressed data; Compressed membership problem; Finite Automata; SLP

Indexed keywords

COMPRESSED DATUM; MEMBERSHIP PROBLEM; NOVEL TECHNIQUES; PARTIAL RESULTS; RECOMPRESSION; SLP; STRAIGHT LINE PROGRAM; TRANSITION LABELS;

COMPUTER SCIENCE;

FINITE AUTOMATA;

EID: 84872958288     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.136     Document Type: Conference Paper

References (21)

1. Martin Beaudry, Pierre McKenzie, Pierre Péladeau, and Denis Thérien. Finite moniods: From word to circuit evaluation. SIAM J. Comput., 26(1): 138-152, 1997.
2. Paweł Gawrychowski. Optimal pattern matching in LZW compressed strings. In Dana Randall, editor, SODA, pages 362-372. SIAM, 2011.
3. Paweł Gawrychowski. Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic. In Camil Demetrescu and Magnús M. Halldórsson, editors, ESA, volume 6942 of LNCS, pages 421-432. Springer, 2011.
4. Blaise Genest and Anca Muscholl. Pattern matching and membership for hierarchical message sequence charts. Theory of Computing Systems, 42(4): 536-567, 2008.
5. Leszek Ga̧sieniec, Marek Karpiński, Wojciech Plandowski, and Wojciech Rytter. Efficient algorithms for Lempel-Ziv encoding. In Rolf G. Karlsson and Andrzej Lingas, editors, SWAT, volume 1097 of LNCS, pages 392-403. Springer, 1996.
6. Artur Jeż. Faster fully compressed pattern matching by recompression. CoRR, 1111.3244, 2011.
7. Artur Jeż and Alexander Okhotin. One-nonterminal conjunctive grammars over a unary alphabet. Theory of Computing Systems, 49(2): 319-342, 2011.
8. Rastislav Královič and Paweł Urzyczyn, editors. Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, volume 4162 of LNCS. Springer, 2006.
9. Sławomir Lasota and Wojciech Rytter. Faster algorithm for bisimulation equivalence of normed context-free processes. In Královič and Urzyczyn [8], pages 646-657.
10. Yury Lifshits. Solving classical string problems an compressed texts. In Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein, editors, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, volume 06201 of Dagstuhl Seminar Proceedings. IBFI, Schloss Dagstuhl, Germany, 2006.
11. Yury Lifshits and Markus Lohrey. Querying and embedding compressed texts. In Královič and Urzyczyn [8], pages 681-692.
12. Markus Lohrey. Word problems and membership problems on compressed words. SIAM Journal of Computing, 35(5): 1210-1240, 2006.
13. Markus Lohrey. Compressed membership problems for regular expressions and hierarchical automata. International Journal of Foundations of Computer Science, 21(5): 817-841, 2010.
14. Markus Lohrey and Christian Mathissen. Compressed membership in automata with compressed labels. In Alexander S. Kulikov and Nikolay K. Vereshchagin, editors, CSR, volume 6651 of LNCS, pages 275-288. Springer, 2011.
15. Markus Lohrey and Saul Schleimer. Efficient computation in groups via compression. In Volker Diekert, Mikhail V. Volkov, and Andrei Voronkov, editors, CSR, volume 4649 of LNCS, pages 249-258. Springer, 2007.
16. Jeremy MacDonald. Compressed words and automorphisms in fully residually free groups. International Journal of Automation and Computing, 20(3): 343-355, 2010.
17. Nicolas Markey and Ph. Schnoebelen. A ptime-complete matching problem for slp-compressed words. Inf. Process. Lett., 90(1): 3-6, 2004.
18. Wojciech Plandowski. Testing equivalence of morphisms on context-free languages. In Jan van Leeuwen, editor, ESA, volume 855 of LNCS, pages 460-470. Springer, 1994.
19. Wojciech Plandowski. Satisfiability of word equations with constants is in PSPACE. Journal of the ACM, 51(3): 483-496, 2004.
20. Wojciech Plandowski and Wojciech Rytter. Application of Lempel-Ziv encodings to the solution of words equations. In Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, ICALP, volume 1443 of LNCS, pages 731-742. Springer, 1998.
21. Wojciech Plandowski and Wojciech Rytter. Complexity of language recognition problems for compressed words. In Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, and Grzegorz Rozenberg, editors, Jewels are Forever, pages 262-272. Springer, 1999.