✦ LIBER ✦

Moments of string and derivation lengths of stochastic context-free grammars

✍ Scribed by Sandra E. Hutchins

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 670 KB
Volume: 4
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(72)90011-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Consistency of stochastic context-free g

Consistency of stochastic context-free grammars

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

Statistical estimation of stochastic con

Statistical estimation of stochastic context-free grammars

✍ Francisco Casacuberta 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Evolutionary induction of stochastic con

Evolutionary induction of stochastic context free grammars

✍ Bill Keller; Rudi Lutz 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Characterizing derivation trees of conte

Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

✍ J.W. Thatcher 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 252 KB

The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.

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