Top-down tree transducers with regular look-ahead

Joost Engelfriet · DAIMI Report Series · 1975

Top-down tree transducers with regular look-ahead are introduced. It is shown how these can be decomposed and composed, and how this leads to closure properties of surface sets and tree transformation languages. Particular attention is paid to deterministic tree transducers.

Read the paper · More papers on PaperTik