581 search results - page 2 / 117 » An Automata Model for Trees with Ordered Data Values |
CSL
2006
Springer
13 years 5 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
ADL
2000
Springer
13 years 9 months ago
2000
Springer
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is clo...
RP
2009
Springer
13 years 12 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
IRI
2008
IEEE
13 years 12 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...