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 …

Invertibility is a fundamental concept in computer science, with various manifestations in
software development (serializer/deserializer, parser/printer, redo/undo, compressor …

When implementing a programming language, we often write a parser and a pretty-printer.
However, manually writing both programs is not only tedious but also error-prone; it may …

Template languages transform tree-structured data into text. We study the reverse problem,
transforming the template into a parser that returns all the tree-structured data that can …

We prove that functionality of compositions of top-down tree transducers is decidable by
reducing the problem to the functionality of one top-down tree transducer with look-ahead.

A tree transducer with origin translates an input tree into a pair of output tree and origin
information. The origin information maps each node in the output tree to the unique node in …

This paper describes a new embedding technique of invertible programming languages,
through the case of the FliPpr language. Embedded languages have the advantage of …

A tree transducer with origin translates an input tree into a pair of output tree and origin info.
The origin info maps each node in the output tree to the unique input node that created it. In …

A tree transducer is a set of mutually recursive functions transforming an input tree into an
output tree. Macro tree transducers extend this recursion scheme by allowing each function …

Invertibility is a fundamental concept in computer science, with various manifestations in
software development (serializer/deserializer, parser/printer, redo/undo, compressor …