Top-down tree transducers with regular look-ahead

Authors

  • Joost Engelfriet

DOI:

https://doi.org/10.7146/dpb.v4i49.6468

Abstract

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.

Author Biography

Joost Engelfriet

Downloads

Published

1975-07-01

How to Cite

Engelfriet, J. (1975). Top-down tree transducers with regular look-ahead. DAIMI Report Series, 4(49). https://doi.org/10.7146/dpb.v4i49.6468

Issue

No. 49 (1975): PB-49 Top-down tree transducers with regular look-ahead

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.