Foundations of XML Processing: The Tree-Automata Approach
This is the first book that provides a solid theoretical account of the foundation of the popular data format XML. Part I establishes basic concepts, starting with schemas, tree automata and pattern matching, and concluding with static typechecking for XML as a highlight of the book. In Part II, the author turns his attention to more advanced topics, including efficient 'on-the-fly' tree automata algorithms, path- and logic-based queries, tree transformation, and exact typechecking. The author provides many examples of code fragments to illustrate features, and exercises to enhance understanding. Thus the book will be ideal for students and researchers whether just beginning, or experienced in XML research.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
accepts a tree alternating tree automaton ambiguity binary tree bottom-up algorithm bottom-up deterministic tree bottom-up run Chapter compute concatenation constraints construction contains current node deﬁned deﬁnition deterministic tree automaton document e-transitions element emptiness test empty sequence end function exact typechecking example Exercise ﬁnal ﬁnite ﬁrst Formally formula gender[male given tree Hosoya initial input tree leaf left child Lemma linear macro tree transducer mapping marking tree automaton multiset of bindings node nodes(f nondeterministic tree automaton pair path expressions pattern match person priority id procedure Proof Qasm reachable recursive regular expression regular tree languages relation RELAX NG result return false return true schema language semantics SGML shufﬂe simple tours speciﬁcation spouse string automaton subtree Theorem top-down algorithm top-down tree transducer transformation transition q transition rule tree-walking automata type inference type name unambiguous unranked trees XHTML XML Schema XPath