Parameter reduction in grammar-compressed trees

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

Volumn 5504 LNCS, Issue , 2009, Pages 212-226

  Lohrey, Markus ^a   Maneth, Sebastian ^b   Schmidt Schauß, Manfred ^c  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BLOW-UP; CONTEXT-FREE; NON-LINEAR; PARAMETER REDUCTION; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE AUTOMATA; TREE GRAMMARS;

POLYNOMIAL APPROXIMATION;

COMPUTER SOFTWARE;

EID: 70350625514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00596-1_16     Document Type: Conference Paper

References (14)

1. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 161-171. Springer, Heidelberg (1992)
2. Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: VLDB 2003, pp. 141-152. Morgan Kaufmann, San Francisco (2003)
3. Busatto, G., Lohrey, M., Maneth, S.: Efficient memory representation of XML document trees. Information Systems 33(4-5), 456-474 (2008)
4. Comon-Lundh, H., Dauchet, M., Gilleron, R., Jacquemard, F., Löding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata
5. Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 168-182. Springer, Heidelberg (2007)
6. Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comp. Syst. Sci. 20, 150-202 (1980)
7. Fischer, M.: Grammars with macro-like productions. PhD thesis, Harvard University, Massachusetts (May 1968)
8. Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory Comput. Syst. 33(1), 59-83 (2000)
9. Gascón, A., Godoy, G., Schmidt-Schauß, M.: Context matching for compressed terms. In: LICS 2008, pp. 93-102. IEEE Computer Society Press, Los Alamitos (2008)
10. Levy, J., Schmidt-Schauß, M., Villaret, M.: Bounded second-order unification is NPcomplete. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 400-414. Springer, Heidelberg (2006)
11. Lohrey,M., Maneth, S.: The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2), 196-210 (2006)
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. Rytter, W.: Grammar compression, LZ-encodings, and string algorithms with implicit input. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 15-27. Springer, Heidelberg (2004)
14. Schmidt-Schauß, M.: Polynomial equality testing for terms with shared substructures. Technical Report 21, Institut für Informatik, J. W. Goethe-Universität Frankfurt am Main (2005)