The complexity of tree automata and XPath on grammar-compressed trees |
| |
Authors: | Markus Lohrey Sebastian Maneth |
| |
Affiliation: | 1. FMI, Universität Stuttgart, Germany;2. National ICT Australia Ltd., Sydney, Australia |
| |
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 in a tree. Several completeness results for the classes NL, P, and PSPACE are obtained. Finally, the complexity of the evaluation problem for (structural) XPath queries on trees that are compressed via straight-line context-free tree grammars is investigated. |
| |
Keywords: | Tree automata XPath Tree compression |
本文献已被 ScienceDirect 等数据库收录! |
|