✦ LIBER ✦

Context-free grammars and nonnegative matrices

✍ Scribed by David Sankoff

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 269 KB
Volume: 5
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(72)90008-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logic hypergraph grammars and context-fr

Logic hypergraph grammars and context-free hypergraph grammars

✍ Isamu Shioya; Katsuhiko Nakamura 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

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

LR(k)-coupled-context-free grammars

✍ Gisela Pitsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 875 KB

Consistency of stochastic context-free g

Consistency of stochastic context-free grammars

✍ Roland Gecse; Attila Kovács 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 405 KB

The Equivalence of Unidirectional Lambek

The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars

✍ Wojcßch Buszkowski 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 1004 KB

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