An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of formal languages, vol. 3
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Path queries on compressed XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient memory representation of XML document trees
Information Systems
Context Matching for Compressed Terms
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM Journal on Computing
The Complexity of Monadic Second-Order Unification
SIAM Journal on Computing
Parameter Reduction in Grammar-Compressed Trees
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Unification with Singleton Tree Grammars
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tree automata with memory, visibility and structural constraints
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Proceedings of the forty-second ACM symposium on Theory of computing
The Emptiness Problem for Tree Automata with Global Constraints
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Tree Structure Compression with RePair
DCC '11 Proceedings of the 2011 Data Compression Conference
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Choosing word occurrences for the smallest grammar problem
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
IEEE Transactions on Information Theory
Complexity of pebble tree-walking automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Proceedings of the 16th International Conference on Database Theory
XML tree structure compression using RePair
Information Systems
Hi-index | 0.00 |
Trees can be conveniently compressed with linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars which are widely used in the development of algorithms that execute directly on compressed structures (without prior decompression). It is shown that every linear straight-line context-free tree grammar can be transformed in polynomial time into a monadic (and linear) one. A tree grammar is monadic if each nonterminal uses at most one context parameter. Based on this result, polynomial time algorithms are presented for testing whether a given (i) nondeterministic tree automaton or (ii) nondeterministic tree automaton with sibling-constraints or (iii) nondeterministic tree walking automaton, accepts a tree represented by a linear straight-line context-free tree grammar. It is also shown that if tree grammars are nondeterministic or non-linear, then reducing their numbers of parameters cannot be done without an exponential blow-up in grammar size.