146 search results - page 5 / 30 » Rewriting of Regular Expressions and Regular Path Queries |
122
click to vote
MST
2006
14 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
TREC
2004
14 years 11 months ago
2004
This is the first year that the Dalhousie University participated in TREC. We submitted three runs for the QA track. Our evaluation results are generally below the median (with on...
DLT
1993
14 years 11 months ago
1993
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
XSYM
2005
Springer
15 years 3 months ago
2005
Springer
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
CC
2005
Springer
14 years 11 months ago
2005
Springer
Various techniques for the navigation and matching of data structures using path expressions have been the subject of extensive investigations. No matter whether such techniques ar...