The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

This book introduces the reader to the notions, the techniques, and the theory of
grammatical picture generation, a research field focusing on formal systems that describe …

The first main result is that if a macro tree translation is of linear size increase, ie, if the size
of every output tree is linearly bounded by the size of the corresponding input tree, then the …

The n-pebble tree transducer was recently proposed as a model for XML query languages.
The four main results on deterministic transducers are: First,(1) the translation τ of an n …

Based on the recursion mechanism of the XML transformation language XSL, the document
transformation language DTL is defined. First the instantiation DTL reg is considered that …

Most implementations of regular expression matching in programming languages are based
on backtracking. With this implementation strategy, matching may not be achieved in linear …

The concept of tree-based picture generation is introduced. It is shown that there are
equivalent tree-based definitions of four picture-generating devices known from the …

Two-way finite state transducers are considered with a fixed number of pebbles, of which the
life times are nested. In the deterministic case, the transductions computed by such pebble …

The composition of total deterministic macro tree transducers gives rise to a proper hierarchy
with respect to their output string languages (these are the languages obtained by taking the …

A graph languageLis in the class C-edNCE of context-free edNCE graph languages if and
only ifL= f (T) wherefis a partial function on graphs that can be defined in monadic second …