Sciweavers

655 search results - page 2 / 131
» Automata, Logic, and XML
Sort
View
ADL
2000
Springer
225views Digital Library» more  ADL 2000»
13 years 9 months ago
Using Regular Tree Automata as XML Schemas
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...
Boris Chidlovskii
WWW
2007
ACM
14 years 6 months ago
Visibly pushdown automata for streaming XML
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
PLANX
2007
13 years 6 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 5 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
IPL
2008
147views more  IPL 2008»
13 years 5 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos