134 search results - page 18 / 27 » Using Regular Tree Automata as XML Schemas |
106
click to vote
LACL
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
132
Voted
WWW
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
94
Voted
SAS
1999
Springer
15 years 4 months ago
1999
Springer
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
113
click to vote
PODS
2008
ACM
16 years 14 days ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
103
Voted
JFP
2006
15 years 9 days ago
2006
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...