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 …

Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform
framework for recursion-based grammars, automata, and transducers, viewed as programs …

We prove a characterization of first-order string-to-string transduction via λ-terms typed in
non-commutative affine logic that compute with Church encoding, extending the analogous …

Two variants of pebble tree-walking automata on binary trees are considered that were
introduced in the literature. It is shown that for each number of pebbles, the two models have …

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 …

Trees can be conveniently compressed with linear straight-line context-free tree grammars.
Such grammars generalize straight-line context-free string grammars which are widely used …

Tree-Walking Automata Page 1 Tree-Walking Automata Miko laj Bojanczyk Warsaw University
Abstract. A survey of tree-walking automata. The main focus is on how the expressive power is …

We consider various kinds of deterministic tree-walking automata, with and without pebbles,
over ranked and unranked trees. For each such kind of automata we show that there is an …

Compositions of tree-walking tree transducers form a hierarchy with respect to the number of
transducers in the composition. As main technical result it is proved that any such …

Graph-walking automata (GWA) are finite-state devices that traverse graphs given as an
input by following their edges; they have been studied both as a theoretical notion and as a …