Back to Search
Start Over
The complexity of tree automata and XPath on grammar-compressed trees
- Source :
-
Theoretical Computer Science . Oct2006, Vol. 363 Issue 2, p196-210. 15p. - Publication Year :
- 2006
-
Abstract
- 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. [Copyright &y& Elsevier]
- Subjects :
- *MACHINE theory
*ROBOTS
*GRAMMAR
*ANIMATRONICS
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 363
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 22637551
- Full Text :
- https://doi.org/10.1016/j.tcs.2006.07.024