✦ LIBER ✦

On the descriptional complexity of scattered context grammars

✍ Scribed by Tomáš Masopust

Book ID: 108281497
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 369 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.10.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simultaneous reduction of several meas

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

✍ H. Fernau; A. Meduna 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 KB

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with a reduced number of both nonterminals and context-sensing productions.

Descriptional complexity of semi-conditi

Descriptional complexity of semi-conditional grammars

✍ Tomáš Masopust; Alexander Meduna 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Descriptional complexity of multi-parall

Descriptional complexity of multi-parallel grammars

✍ Tomáš Masopust 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 109 KB

A note on the descriptional complexity o

A note on the descriptional complexity of semi-conditional grammars

✍ Fumiya Okubo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 150 KB

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

Chart parsing of scattered context gramm

Chart parsing of scattered context grammars

✍ F. Popowich 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

scattered context grammars are a class of context-sensitive grammars. The rules of these grammars can be viewed ss sequences of traditional context-free grammar rules. We show how a chart-parsing algorithm for context-free grammars can be extended to scattered context grammars. ## 1. SCATTERED CONT