𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Logic hypergraph grammars and context-free hypergraph grammars

✍ Scribed by Isamu Shioya; Katsuhiko Nakamura

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
711 KB
Volume
22
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cooperation in context-free grammars
Cooperation in context-free grammars
✍ JΓΌrgen Dassow; Victor Mitrana πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 527 KB

A new dynamical measure of the descriptional complexity for context-free grammars and languages, namely the degree of cooperation, is introduced and studied. This measure is connected with respect to both families of languages considered, namely the regular and context-free languages. We prove that

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