Compressed membership in automata with compressed labels

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6651 LNCS, Issue , 2011, Pages 275-288

  Lohrey, Markus ^a   Mathissen, Christian ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROBLEMS; INPUT SIZE; POLYNOMIAL-TIME; STRAIGHT LINE PROGRAM; STRING COMPRESSION; TRANSITION LABELS; UPPER BOUND; WORD LENGTH;

ALGORITHMS; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION;

FINITE AUTOMATA;

EID: 79959293683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20712-9_21     Document Type: Conference Paper

References (15)

1. Book, R.V., Otto, F.: String-Rewriting Systems. Springer, Heidelberg (1993).
2. Choffrut, C., Karhum̈aki, J.: Combinatorics on words. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol. 1 ch. 6, pp. 329-438. Springer, Heidelberg (1997).
3. Gasieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding (extended abstract). In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 392-403. Springer, Heidelberg (1996). (Pubitemid 126091945)
4. Hagenah, C.: Gleichungen mit regul̈aren Randbedingungen ̈uber freien Gruppen. PhD thesis, University of Stuttgart, Institut f̈ur Informatik (2000).
5. Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007).
6. Lifshits, Y., Lohrey, M.: Querying and embedding compressed texts. In: Kŕalovic, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 681-692. Springer, Heidelberg (2006). (Pubitemid 44577955)
7. Lohrey, M.: Compressed membership problems for regular expressions and hierarchical automata. Internat. J. Found. Comput. Sci. 21(5), 817-841 (2010).
8. Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 249-258. Springer, Heidelberg (2007). (Pubitemid 350271274)
9. Lohrey,M.:Word problems and membership problems on compressed words. SIAMJ. Comput. 35(5), 1210-1240 (2006). (Pubitemid 44599924)
10. Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983).
11. Macdonald, J.: Compressed words and automorphisms in fully residually free groups. Internat. J. Algebra Comput. 20(3), 343-355 (2010).
12. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: Van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460-470. Springer, Heidelberg (1994).
13. Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 262-272. Springer, Heidelberg (1999).
14. Schleimer, S.: Polynomial-time word problems. Comment. Math. Helv. 83(4), 741-765 (2008).
15. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337-343 (1977)