Pages that link to "Item:Q440015"
From MaRDI portal
The following pages link to Parameter reduction and automata evaluation for grammar-compressed trees (Q440015):
Displaying 21 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Vulnerability aware graphs for RFID protocol security benchmarking (Q2346924) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Regular matching and inclusion on compressed tree patterns with constrained context variables (Q2672652) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars (Q4608715) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- Grammar-based compression of unranked trees (Q5915574) (← links)
- Largest common prefix of a regular tree language (Q5919000) (← links)
