Sciweavers

Share
ACL
1992

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

9 years 5 months ago
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.
David J. Weir
Added 06 Nov 2010
Updated 06 Nov 2010
Type Conference
Year 1992
Where ACL
Authors David J. Weir
Comments (0)
books