Top-down tree transducers with regular look-ahead

Joost Engelfriet

    Research output: Contribution to journalArticleAcademic

    119 Citations (Scopus)
    50 Downloads (Pure)

    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.
    Original languageUndefined
    Pages (from-to)289-303
    JournalMathematical systems theory
    Volume10
    Issue number1
    DOIs
    Publication statusPublished - 1977

    Keywords

    • IR-85445

    Cite this

    Engelfriet, Joost. / Top-down tree transducers with regular look-ahead. In: Mathematical systems theory. 1977 ; Vol. 10, No. 1. pp. 289-303.
    @article{469934ed30ea400baed20765798d56d1,
    title = "Top-down tree transducers with regular look-ahead",
    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.",
    keywords = "IR-85445",
    author = "Joost Engelfriet",
    year = "1977",
    doi = "10.1007/BF01683280",
    language = "Undefined",
    volume = "10",
    pages = "289--303",
    journal = "Theory of computing systems",
    issn = "1432-4350",
    publisher = "Springer",
    number = "1",

    }

    Top-down tree transducers with regular look-ahead. / Engelfriet, Joost.

    In: Mathematical systems theory, Vol. 10, No. 1, 1977, p. 289-303.

    Research output: Contribution to journalArticleAcademic

    TY - JOUR

    T1 - Top-down tree transducers with regular look-ahead

    AU - Engelfriet, Joost

    PY - 1977

    Y1 - 1977

    N2 - 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.

    AB - 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.

    KW - IR-85445

    U2 - 10.1007/BF01683280

    DO - 10.1007/BF01683280

    M3 - Article

    VL - 10

    SP - 289

    EP - 303

    JO - Theory of computing systems

    JF - Theory of computing systems

    SN - 1432-4350

    IS - 1

    ER -