Abstract
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 efficiently 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.
Cite
CITATION STYLE
Ganardi, M., Hucke, D., Lohrey, M., & Noeth, E. (2016). Tree compression using string grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9644, pp. 590–604). Springer Verlag. https://doi.org/10.1007/978-3-662-49529-2_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
