✦ LIBER ✦

Syntactic complexity of scattered context grammars

✍ Scribed by Alexander Meduna

Book ID: 118772283
Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 604 KB
Volume: 32
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf01178263

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the descriptional complexity of scatt

On the descriptional complexity of scattered context grammars

✍ Tomáš Masopust 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Syntactic complexity of context-free gra

Syntactic complexity of context-free grammars over word monoids

✍ Alexander Meduna 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 258 KB

Scattered context grammars

✍ Sheila Greibach; John Hopcroft 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 676 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

A note on scattered context grammars

✍ David L. Milgram; Azriel Rosenfeld 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 681 KB

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.