Top-down tree transducers with regular look-ahead

Forfattere

  • Joost Engelfriet

DOI:

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

Resumé

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.

Forfatterbiografi

Joost Engelfriet

Downloads

Publiceret

1975-07-01

Citation/Eksport

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

Nummer

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

Sektion

Articles

Licens

Creative Commons License

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