Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

WIA
2005
Springer

favoriteEmaildiscussreport

49views Artificial Intelligence» more WIA 2005»

Tree Automata and XPath on Compressed Trees

13 years 10 months ago

Tree Automata and XPath on Compressed Trees

Download inf.informatik.uni-stuttgart.de

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 contextfree 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.

Markus Lohrey, Sebastian Maneth

Real-time Traffic

Artificial Intelligence | Straight-line Context-free Tree | Straight-line Contextfree Tree | Tree Grammars | WIA 2005 |

claim paper

Related Content

» XPath Whole Query Optimization

» A Direct Translation from XPath to Nondeterministic Automata

» Fast InMemory XPath Search using Compressed Indexes

» XPath transitive closure logic and nested tree walking automata

» Deciding XPath containment with MSO

» Alternating Automata on Data Trees and XPath Satisfiability

» Transitive closure logic nested tree walking automata and XPath

» ForwardXPath and extended register automata on datatrees

» Schema Validation and Type Annotation for Encoded Trees

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WIA
Authors	Markus Lohrey, Sebastian Maneth

Comments (0)