Top-down tree transducers with deterministic top-down look-ahead
✍ Scribed by Z. Fülöp; S. Vágvölgyi
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 489 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
As top-down tree transducers generalize generalized sequential machines, shape preserving top-down tree transducers naturally generalize length preserving generalized sequential machines. For instance, top-down relabeling tree transducers are shape preserving top-down tree transducers. We show that
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deterministic) bottom-up tree transducer except that it translates trees into hypergraphs rather than trees, using hypergraph substitution instead of tree substitution. If every output hypergraph of the tr