Top-down tree transducers with regular look-ahead

Joost Engelfriet

    Research output: Contribution to journalArticleAcademic

    119 Citations (Scopus)
    65 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