TreeRePair
From MaRDI portal
Software:43870
No author found.
Related Items (13)
XML compression via directed acyclic graphs ⋮ Approximation of smallest linear tree grammar ⋮ Constructing small tree grammars and small circuits for formulas ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ Properties of graphs specified by a regular language ⋮ Tree compression using string grammars ⋮ Properties of graphs specified by a regular language ⋮ Grammar-based compression of unranked trees ⋮ Constant-time tree traversal and subtree equality check for grammar-compressed trees ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Constant delay traversal of grammar-compressed graphs with bounded rank ⋮ Tree compression with top trees ⋮ Faster Compressed Suffix Trees for Repetitive Collections
This page was built for software: TreeRePair
