28 search results - page 5 / 6 » On the minimization of XML Schemas and tree automata for unr... |
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
PODS
2010
ACM
14 years 18 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ICDT
2010
ACM
14 years 4 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
LICS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
DBPL
2005
Springer
14 years 1 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...