We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are
kinds of higher-order tree transducers that take input trees and output a (possibly infinite) …

We prove that equivalence of deterministic top-down tree-to-string transducers is decidable,
thus solving a long-standing open problem in formal language theory. We also present …

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 …

Streaming of XML transformations is a challenging task and only a few existing systems
support streaming. Research approaches generally define custom fragments of XQuery and …

We show that problems arising in static analysis of XML specifications and transformations
can be dealt with using techniques similar to those developed for static analysis of …

Inverse computation has many applications such as serialization/deserialization, providing
support for undo, and test-case generation for software testing. In this paper, we propose an …

Despite the extensiveness of recent investigations on static ty** for XML, parametric
polymorphism has rarely been treated. This well-established ty** discipline can also be …

This paper presents a new approach to solving the problem of verification of graph
transformation, by proposing a new static verification algorithm for the Core UnCAL, the …

The decidability of equivalence for three important classes of tree transducers is discussed.
Each class can be obtained as a natural restriction of deterministic macro tree transducers …

Various entities within and related to higher education offer activities designed to promote
professional development of faculty in the area of teaching. A critical challenge to these …