Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

LATIN
2016
Springer

favoriteEmaildiscussreport

75views Information Technology» more LATIN 2016»

Tree Compression Using String Grammars

8 years 10 days ago

Tree Compression Using String Grammars

Download www.eti.uni-siegen.de

We study the compressed representation of a ranked tree by a straight-line program (SLP) for its preorder traversal string, and compare it with the previously studied representation by straight-line context-free tree grammars (also known as tree straight-line programs or TSLPs). Although SLPs may be exponentially more succinct than TSLPs, we show that many simple tree queries can still be performed eﬃciently on SLPs, such as computing the height of a tree, tree navigation, or evaluation of Boolean expressions. Other problems like pattern matching and evaluation of tree automata become intractable.

Moses Ganardi, Danny Hucke, Markus Lohrey, Eric No

Real-time Traffic

Information Technology | LATIN 2016 |

claim paper

Related Content

» Parameter Reduction in GrammarCompressed Trees

» Tree Structure Compression with RePair

» SecondOrder Abstract Categorial Grammars as Hyperedge Replacement Grammars

» Estimating Compact Yet Rich Tree Insertion Grammars

» Automata on Lempelziv Compressed Strings

» OnLine LinearTime Construction of Word Suffix Trees

» The Use of Shared Forests in Tree Adjoining Grammar Parsing

» Using an Annotated Corpus as a Stochastic Grammar

» Efficiently building a parse tree from a regular expression

» XML Tree Structure Compression

Post Info
More Details (n/a)

Added	07 Apr 2016
Updated	07 Apr 2016
Type	Journal
Year	2016
Where	LATIN
Authors	Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth

Comments (0)