Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers

We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. From equivalences that have previously been established we know that this class of languages is also equal to the string languages generated by context-free hypergraph grammars, multicomponent tree-adjoining grammars, and multiple contextfree grammars and to the class of yields of images of the regular tree languages under finite-copying topdown tree transducers.

• Type: Conference
• Year: 1992
• Where: ACL
• Authors: David J. Weir
• Keywords: ACL 1992, ACL 2007, Context-free Hypergraph Grammars, Context-Free Rewriting Systems, Multicomponent Tree-adjoining Grammars