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 …

We extend a classic result of Büchi, Elgot, and Trakhtenbrot: MSO definable string
transductions ie, string-to-string functions that are definable by an interpretation using …

We propose a deterministic model for associating costs with strings that is parameterized by
operations of interest (such as addition, scaling, and minimum), a notion of regularity that …

We propose quantitative regular expressions (QREs) as a high-level programming
abstraction for specifying complex numerical queries over data streams in a modular way …

We focus on (partial) functions that map input strings to a monoid such as the set of integers
with addition and the set of output strings with concatenation. The notion of regularity for …

MSO logic on unranked trees has been identified as a convenient theoretical framework for
reasoning about expressiveness and implementations of practical XML query languages. As …

Two well-known formalisms for the specification and computation of tree transductions are
compared: the mso graph transducer and the attributed tree transducer with look-ahead …

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 theory of regular transformations of finite strings is quite mature with appealing
properties. This class can be equivalently defined using both logic (Monadic second-order …

Vijay-Shanker et al.(1987) note that many interesting linguistic formalisms can be thought of
as having essentially context-free structure, but operating over objects richer than simple …