The complexity of tree automata and XPath on grammar-compressed trees

Markus Lohrey, Sebastian Maneth

Research output: Contribution to journalArticlepeer-review

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.
Original languageEnglish
Pages (from-to)196-210
Number of pages15
JournalTheoretical Computer Science
Volume363
Issue number2
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'The complexity of tree automata and XPath on grammar-compressed trees'. Together they form a unique fingerprint.

Cite this