Automata for XML---A survey
TLDR
An overview of fundamental properties of the different kinds of automata used in XML processing are given to relate them to the four key aspects of XML processing: schemas, navigation, querying and transformation.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2007-05-01 and is currently open access. It has received 154 citations till now. The article focuses on the topics: XML Schema Editor & XML schema.read more
Citations
More filters
Journal ArticleDOI
Adding nesting structure to words
Rajeev Alur,P. Madhusudan +1 more
TL;DR: In this paper, the authors define nested word automata, which generalize both words and ordered trees, and allow both word and tree operations, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nestedword automata are as expressive as their non-deterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-a, prefixes, and language homomorphisms; membership, emptiness, language equivalence are all decidable;
Journal ArticleDOI
XPath leashed
Michael Benedikt,Christoph Koch +1 more
TL;DR: This survey gives an overview of formal results on the XML query language XPath and its fragments compared to other formalisms for querying trees, algorithms, and complexity bounds for evaluation ofXPath queries, as well as static analysis of XPath queries.
Book ChapterDOI
Weighted Tree Automata and Tree Transducers
Zoltán Fülöp,Heiko Vogler +1 more
TL;DR: The equivalence between recognizable tree series and equational, rational, and MSO-definable tree series is discussed, and a comparison of several other models of recognizability is presented.
Journal ArticleDOI
XML tree structure compression using RePair
TL;DR: A new linear time algorithm for computing small SLCF tree grammars, called TreeRePair, is presented and it is shown that it greatly outperforms the best known previous algorithm BPLEX.
Journal Article
Querying unranked trees with stepwise tree automata
TL;DR: Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic by reduction to the ranked case via a new systematic correspondence that relates unranked and ranked queries.
References
More filters
Journal Article
Extensible Markup Language (XML).
TL;DR: XML is an extremely simple dialect of SGML which is completely described in this document, to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML.
Journal ArticleDOI
Extensible markup language
TL;DR: XML is the lingua franca of the wireless Web and is already being used for a host of server-server communication applications, which make it possible for different data servers to easily exchange information.
Book
Tree Automata Techniques and Applications
Hubert Comon,Max Dauchet,Rémi Gilleron,Florent Jacquemard,Denis Lugiez,Christof Löding,Sophie Tison,Marc Tommasi +7 more
TL;DR: The goal of this book is to provide a textbook which presents the basics ofTree automata and several variants of tree automata which have been devised for applications in the aforementioned domains.
Book ChapterDOI
Languages, automata, and logic
TL;DR: The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.
Journal ArticleDOI
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.