Implementation and Application of Automata

Volume 3845 of the series Lecture Notes in Computer Science pp 225-237

Tree Automata and XPath on Compressed Trees

  • Markus LohreyAffiliated withFMI, University of Stuttgaert
  • , Sebastian ManethAffiliated withFaculté I & C, EPFL

* Final gross prices may vary according to local VAT.

Get Access


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.