Pages that link to "Item:Q269349"
From MaRDI portal
The following pages link to XML compression via directed acyclic graphs (Q269349):
Displaying 13 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- A bijection of plane increasing trees with relaxed binary trees of right height at most one (Q1725684) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Compacted binary trees admit a stretched exponential (Q2005184) (← links)
- Distinct fringe subtrees in random trees (Q2105315) (← links)
- Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- (Q5005115) (← links)
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments (Q6074703) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
- Slowing down top trees for better worst-case compression (Q6614009) (← links)
