License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.445
URN: urn:nbn:de:0030-drops-44789
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4478/
Jez, Artur ;
Lohrey, Markus
Approximation of smallest linear tree grammar
Abstract
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(r^2.g.log(n)) for a given input tree T of size n is presented, where g is the size of a minimal linear context-free tree grammar for T, and r is the maximal rank of symbols in T (which is a constant in many applications). This is the first example of a grammar-based tree compression algorithm with an approximation ratio polynomial in g. The analysis of the algorithm uses an extension of the recompression technique (used in the context of grammar-based string compression) from strings to trees.
BibTeX - Entry
@InProceedings{jez_et_al:LIPIcs:2014:4478,
author = {Artur Jez and Markus Lohrey},
title = {{Approximation of smallest linear tree grammar}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {445--457},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Ernst W. Mayr and Natacha Portier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4478},
URN = {urn:nbn:de:0030-drops-44789},
doi = {10.4230/LIPIcs.STACS.2014.445},
annote = {Keywords: Grammar-based compression, Tree compression, Tree-grammars}
}
Keywords: |
|
Grammar-based compression, Tree compression, Tree-grammars |
Collection: |
|
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) |
Issue Date: |
|
2014 |
Date of publication: |
|
05.03.2014 |