The complexity of tree automata and XPath on grammar-compressed trees (Q860863)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5083509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of tree automata and XPath on grammar-compressed trees |
scientific article; zbMATH DE number 5083509 |
Statements
The complexity of tree automata and XPath on grammar-compressed trees (English)
0 references
9 January 2007
0 references
tree automata
0 references
XPath
0 references
tree compression
0 references
0 references
0.96249115
0 references
0.8935431
0 references
0.87255657
0 references
0.8721307
0 references
0.8701756
0 references
0 references
0.8668046
0 references
