Sciweavers

131
Voted
DCC
2011
IEEE
14 years 3 months ago
Tree Structure Compression with RePair
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
Markus Lohrey, Sebastian Maneth, Roy Mennicke