Results 1 
1 of
1
The Equivalence of BottomUp and TopDown TreetoGraph Transducers
 J. COMPUT. SYST. SCI
, 1996
"... We introduce the bottomup treetograph transducer, which is very similar to the usual (total deterministic) bottomup 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 ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We introduce the bottomup treetograph transducer, which is very similar to the usual (total deterministic) bottomup 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 transducer is a jungle, i.e., a hypergraph that can be unfolded into a tree, then the treetograph transducer is said to be treegenerating and naturally defines a treetotree translation. We prove that bottomup treetograph transducers define the same treetotree translations as the previously introduced topdown treetograph transducers. This is in contrast with the wellknown incomparability of the usual bottomup and topdown tree transducers.