Pages that link to "Item:Q860863"
From MaRDI portal
The following pages link to The complexity of tree automata and XPath on grammar-compressed trees (Q860863):
Displaying 15 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Recognition of directed acyclic graphs by spanning tree automata (Q1959657) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Parameter Reduction in Grammar-Compressed Trees (Q3617731) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)
- Slowing Down Top Trees for Better Worst-Case Compression (Q5140780) (← links)
