✦ LIBER ✦

Completeness of context-free grammar forms

✍ Scribed by H.A. Maurer; A. Salomaa; D. Wood

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 600 KB
Volume: 23
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90001-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Descriptional complexity of context-free

Descriptional complexity of context-free grammar forms

✍ Erzsébet Csuhaj-Varjú; Alica Kelemenová 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Parallel context-free array grammar norm

Parallel context-free array grammar normal forms

✍ Patrick Shen-Pei Wang 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 342 KB

On the computational completeness of con

On the computational completeness of context-free parallel communicating grammar systems

✍ Erzsébet Csuhaj-Varjú; György Vaszil 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 632 KB

We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete.

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

Consistency of stochastic context-free g

Consistency of stochastic context-free grammars

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

LR(k)-coupled-context-free grammars

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