Tree automata and XPath on compressed trees

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

Volumn 3845 LNCS, Issue , 2006, Pages 225-237

  Lohrey, Markus ^a   Maneth, Sebastian ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPLETENESS; COMPRESSED TREES; EVALUATION PROBLEM; TREE AUTOMATA;

AUTOMATA THEORY;

EID: 33745130350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605157_19     Document Type: Conference Paper

References (23)

1. Lohrey, M.: Word problems on compressed word. In Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D., eds.: Proc. ICALP 2004, Turku (Finland). Number 3142 in Lecture Notes in Computer Science, Springer (2004) 906-918
2. Rytter, W.: Grammar compression, LZ-encodings, and string algorithms with implicit input. In Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D., eds.: Proc. ICALP 2004, Turku (Finland). Number 3142 in Lecture Notes in Computer Science, Springer (2004) 15-27
3. Plump, D.: Term graph rewriting. In Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G., eds.: Handbook of Graph Grammars and Computing by Graph Transformation. Volume 2. World Scientific (1999) 3-61
4. Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24 (1992) 293-318
5. Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In Freytag, J.C., et al., eds.: Proc. VLDB 2003, Morgan Kaufmann (2003) 141-152
6. Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: Proc. LICS'2003, IEEE Computer Society Press (2003) 188-197
7. Maneth, S., Busatto, G.: Tree transducers and tree compressions. In Walukiewicz, I., ed.: Proc. FoSSaCS 2004, Barcelona (Spain). Number 2987 in Lecture Notes in Computer Science, Springer (2004) 363-377
8. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on: http://ww.grappa.univ-lille3.fr/tata (2002)
9. Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML documents. In: Proc. DBPL 2005, Trondheim (Norway), Springer (2005) to appear.
10. Gécseg, F., Steinby, M.: Tree automata. Akadémiai Kiadó (1984)
11. Murata, M., Lee, D., Mani, M.: Taxonomy of XML Schema Languages using Formal Language Theory. In: Proc. Extreme Markup Languages 2000, Montréal (Canada) (2000)
12. Neven, F.: Automata theory for XML researchers. SIGMOD Record 31 (2002) 39-46
13. Lohrey, M.: On the parallel complexity of tree automata. In Middeldorp, A., ed.: Proc. RTA 2001, Utrecht (The Netherlands). Number 2051 in Lecture Notes in Computer Science, Springer (2001) 201-215
14. Segoufin, L.: Typing and querying XML documents: some complexity bounds. In: Proc. PODS 2003, ACM Press (2003) 167-178
15. Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer (1999)
16. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proc. VLDB 2002, Morgan Kaufmann (2002) 95-106
17. Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: Proc. PODS 2003, ACM Press (2003) 179-190
18. Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)
19. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)
20. Courcelle, B.: A representation of trees by languages I. Theoretical Computer Science 6 (1978) 255-279
21. Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Information Processing Letters 94 (2005) 231-240
22. Markey, N., Schnoebelen, P.: A PTIME-complete matching problem for SLP-compressed words. Information Processing Letters 90 (2004) 3-6
23. Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. Journal of Computer and System Sciences 58 (1999) 407-427