Abstract
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical subtrees in a tree, and straight-line context-free tree grammars, which moreover allow to share identical intermediate parts of a tree. Several completeness results for the classes NL, P, and PSPACE are obtained. Finally, the complexity of the XPath evaluation problem on trees that are compressed via straight-line context-free tree grammars is investigated. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Lohrey, M., & Maneth, S. (2006). Tree automata and XPath on compressed trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3845 LNCS, pp. 225–237). https://doi.org/10.1007/11605157_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
