Parameter reduction and automata evaluation for grammar-compressed trees

Journal of Computer and System Sciences

Volumn 78, Issue 5, 2012, Pages 1651-1669

  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

Context free tree grammars; Straight line programs; Tree automata; Tree compression

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE GRAMMARS; POLYNOMIAL APPROXIMATION; ROBOTS;

CONTEXT-FREE TREE GRAMMARS; PARAMETER REDUCTION; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; STRAIGHT LINE PROGRAM; TREE AUTOMATA; TREE COMPRESSION; TREE-WALKING AUTOMATON;

FORESTRY;

COMPUTER PROGRAMS; NONLINEAR PROGRAMING; ROBOTS;

EID: 84861605753     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2012.03.003     Document Type: Conference Paper

References (44)

1. W. Rytter Grammar compression, LZ-encodings, and string algorithms with implicit input 31st Internat. Colloquium on Automata, Languages and Programming, ICALP04 Lecture Notes in Comput. Sci. vol. 3142 2004 Springer Berlin 15 27
2. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat The smallest grammar problem IEEE Trans. Inform. Theory 51 2005 2554 2576
3. R. Carrascosa, F. Coste, M. Gallé, and G.G.I. López Choosing word occurrences for the smallest grammar problem 4th Internat. Conference on Language and Automata Theory and Applications, LATA10 Lecture Notes in Comput. Sci. vol. 6031 2010 Springer Berlin 154 165
4. M. Karpinski, W. Rytter, and A. Shinohara An efficient pattern-matching algorithm for strings with short descriptions Nordic J. Comput. 4 1997 172 186
5. M. Miyazaki, A. Shinohara, and M. Takeda An improved pattern matching algorithm for strings in terms of straight-line programs J. Discrete Algorithms 1 2000 187 204
6. W. Rytter Compressed and fully compressed pattern-matching in one and two dimensions Proc. IEEE 88 2000 1769 1778
7. W. Plandowski Testing equivalence of morphisms on context-free languages Second European Symposium on Algorithms, ESA94 Lecture Notes in Comput. Sci. vol. 855 1994 Springer Berlin 460 470
8. Y. Lifshits Processing compressed texts: A tractability border 18th Annual Symposium on Combinatorial Pattern Matching, CPM07 Lecture Notes in Comput. Sci. vol. 4580 2007 Springer Berlin 228 240
9. M. Schmidt-Schauß, G. Schnitger, Fast equality test for straight-line compressed strings, Frank report 45, Institut für Informatik, Fachbereich Informatik und Mathematik, J.W. Goethe-Universität, Frankfurt am Main, 2011.
10. G. Busatto, M. Lohrey, and S. Maneth Efficient memory representation of XML document trees Inf. Syst. 33 2008 456 474
11. M. Lohrey, and S. Maneth The complexity of tree automata and XPath on grammar-compressed trees Theoret. Comput. Sci. 363 2006 196 210
12. J. Lamping An algorithm for optimal lambda calculus reductions 17th Annual ACM Symposium on Principles of Programming Languages, POPL90 1990 ACM Press 16 30
13. M. Lohrey, S. Maneth, and R. Mennicke Tree structure compression with repair Data Compression Conference, DCC 2011 2011 IEEE Computer Society Press 353 362
14. P. Buneman, M. Grohe, and C. Koch Path queries on compressed XML 29th Internat. Conference on Very Large Data Bases, VLDB03 2003 Morgan Kaufmann 141 152
15. M. Schmidt-Schauß, Polynomial equality testing for terms with shared substructures, Frank report 21, Institut für Informatik, Fachbereich Informatik und Mathematik, J.W. Goethe-Universität, Frankfurt am Main, 2005.
16. D.K. Fisher, and S. Maneth Structural selectivity estimation for XML documents 23rd Internat. Conference on Data Engineering, ICDE07 2007 IEEE Computer Society Press 626 635
17. S. Maneth, T. Sebastian, Fast and tiny structural self-indexes for XML, CoRR abs/1012.5696, 2010.
18. A. Gascón, S. Maneth, and L. Ramos First-order unification on compressed terms 22nd Internat. Conference on Rewriting Techniques and Applications, RTA 2011 LIPIcs vol. 10 2011 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 51 60
19. A. Gascón, G. Godoy, and M. Schmidt-Schauß Unification and matching on compressed terms ACM Trans. Comput. Log. 12 2011 (electronic), 26 pp
20. A. Gascón, G. Godoy, and M. Schmidt-Schauß Unification with singleton tree grammars 20th Internat. Conference on Rewriting Techniques and Applications, RTA09 Lecture Notes in Comput. Sci. vol. 5595 2009 Springer Berlin 365 379
21. A. Gascón, G. Godoy, and M. Schmidt-Schauß Context matching for compressed terms 23rd Annual IEEE Symposium on Logic in Computer Science, LICS08 2008 IEEE Computer Society Press 93 102
22. J. Levy, M. Schmidt-Schauß, and M. Villaret The complexity of monadic second-order unification SIAM J. Comput. 38 2008 1113 1140
23. B. Bogaert, and S. Tison Equality and disequality constraints on direct subterms in tree automata 9th Symposium on Theoretical Aspects of Computer Science, STACS92 Lecture Notes in Comput. Sci. vol. 577 1992 Springer Berlin 161 172
24. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, C. Löding, D. Lugiez, S. Tison, and M. Tommasi Tree automata techniques and applications available at: http://www.grappa.univ-lille3.fr/tata 2007
25. H. Comon-Lundh, F. Jacquemard, and N. Perrin Tree automata with memory, visibility and structural constraints 10th Internat. Conference on Foundations of Software Science and Computational Structures, FoSSaCS07 Lecture Notes in Comput. Sci. vol. 4423 2007 Springer Berlin 168 182
26. M. Bojanczyk, and T. Colcombet Tree-walking automata do not recognize all regular languages SIAM J. Comput. 38 2008 658 701
27. M. Bojanczyk Tree-walking automata Survey presented as tutorial at LATA 2008, available at: http://www.mimuw.edu.pl/~bojan/papers/twasurvey.pdf 2008
28. M. Samuelides, and L. Segoufin Complexity of pebble tree-walking automata 16th Internat. Symposium on Fundamentals of Computation Theory, FCT07 Lecture Notes in Comput. Sci. vol. 4639 2007 Springer Berlin 458 469
29. M. Lohrey, S. Maneth, and M. Schmidt-Schauß Parameter reduction in grammar-compressed trees 12th Internat. Conference on Foundations of Software Science and Computational Structures, FOSSACS09 Lecture Notes in Comput. Sci. vol. 5504 2009 Springer Berlin 212 226
30. J.W. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 1979 Addison-Wesley
31. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation - International Edition 2nd ed. 2003 Addison-Wesley
32. F. Gécseg, and M. Steinby Tree languages G. Rozenberg, A. Salomaa, Handbook of Formal Languages, vol. 3 1997 Springer 1 68
33. B. Courcelle A representation of trees by languages I Theoret. Comput. Sci. 6 1978 255 279
34. A.V. Aho, and J.D. Ullman Translations on a context-free grammar Inform. and Control 19 1971 439 475
35. J. Engelfriet, H.J. Hoogeboom, and B. Samwel XML transformation by tree-walking transducers with invisible pebbles 26th Symposium on Principles of Database Systems, PODS07 2007 ACM Press 63 72
36. M. Fischer, Grammars with macro-like productions, PhD thesis, Harvard University, Massachusetts, 1968.
37. A. Fujiyoshi, and T. Kasai Spinal-formed context-free tree grammars Theory Comput. Syst. 33 2000 59 83
38. J. Levy, M. Schmidt-Schauß, and M. Villaret Bounded second-order unification is NP-complete 17th International Conference on Term Rewriting and Applications, RTA06 Lecture Notes in Comput. Sci. vol. 4098 2006 Springer Berlin 400 414
39. J. Levy, M. Schmidt-Schauß, and M. Villaret On the complexity of bounded second-order unification and stratified context unification Log. J. IGPL 19 2011 763 789
40. M. Saadi, Auswertung von Tree Walking Automaten auf komprimierten Daten, Masters thesis, Universität, Leipzig, 2009.
41. J. Engelfriet, G. Rozenberg, and G. Slutzki Tree transducers, L systems, and two-way machines J. Comput. System Sci. 20 1980 150 202
42. G. Godoy, O. Giménez, L. Ramos, and C. Àlvarez The HOM problem is decidable 42nd ACM Symposium on Theory of Computing, STOC10 2010 ACM Press 485 494
43. L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher The emptiness problem for tree automata with global constraints Proc. LICS 2010 2010 IEEE Computer Society Press 263 272
44. E. Filiot, J.-M. Talbot, and S. Tison Tree automata with global constraints Internat. J. Found. Comput. Sci. 21 2010 571 596