Tree transductions and families of tree languages

Brenda S. Baker · 1973

Interest in the study of sets of trees, tree languages, has led to the definition of finite automata which accept trees [2,11] and transducers which map trees into other trees [7,9,10]. These generalized machines may read treesfinite automata which accept trees [2,11] and of transducers which map trees into other trees [7,9,10]. These generalized machines may read trees either “top-down” (from the root toward the leaves) or “bottom-up” (from the leaves toward the root).

Read the paper · More papers on PaperTik