𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars

✍ Scribed by Stephan Kepser; Jim Rogers

Publisher
Springer Netherlands
Year
2011
Tongue
English
Weight
430 KB
Volume
20
Category
Article
ISSN
0925-8531

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The equivalence of Nonassociative Lambek
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
✍ Maciej Kandulski πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 699 KB

Besides this introduction the paper contains four sections. I n section 1 we describe three equivalent axiomatizations of NLP. the third one playing important role in what follows. I n section 2 we deal with a system AC: (the Ajdukiewicz calculus with product) and prove the equivalence of AC-grammar

A Comparison of Tree Transductions Defin
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
✍ Roderick Bloem; Joost Engelfriet πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 547 KB

Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in t