134 search results - page 14 / 27 » Using Regular Tree Automata as XML Schemas |
IM
2003
13 years 8 months ago
2003
: Internet Management is based on IETF specifications that have been developed and used during the past 14 years: There are multiple versions and options of the management protoco...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
The nature of semistructured data in web collections is evolving. Increasingly, XML web documents (or documents exchanged via web services) are valid with regard to a schema, yet ...
ADBIS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...