134 search results - page 3 / 27 » Using Regular Tree Automata as XML Schemas |
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
FOIKS
2010
Springer
14 years 18 days ago
2010
Springer
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
WEBDB
2004
Springer
13 years 11 months ago
2004
Springer
Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. Although DTDs and XML Schema Defintions (XSDs) di...
PODS
2005
ACM
14 years 5 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...