134 search results - page 20 / 27 » Using Regular Tree Automata as XML Schemas |
DOCENG
2003
ACM
13 years 12 months ago
2003
ACM
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
PODS
2010
ACM
13 years 11 months 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 ...
RTA
2010
Springer
13 years 10 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
LICS
2012
IEEE
11 years 9 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...
BDA
2006
13 years 8 months ago
2006
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...