Linear context-free rewriting systems and deterministic tree-walking transducers

Authors:
David J. Weir
Affiliations:
University of Sussex, Falmer, Brighton
Venue:
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Year:
1992

Citing 4
Cited 7

The string generating power of context-free hypergraph grammars

Journal of Computer and System Sciences
Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement

STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Parsing mildly context-sensitive languages with thread automata

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars

IEICE - Transactions on Information and Systems
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars

Journal of Logic, Language and Information
Optimal rank reduction for linear context-free rewriting systems with fan-out two

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Minimalist grammars in the light of logic

Logic and grammar
Second position clitics and monadic second-order transduction

ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 tree-walking 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 context-free grammars and to the class of yields of images of the regular tree languages under finite-copying top-down tree transducers.