✦ LIBER ✦

Coincidental extension of scattered context languages

✍ Scribed by Alexander Meduna

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 55 KB
Volume: 39
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-003-0127-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coincidental extension of scattered cont

Coincidental extension of scattered context languages

✍ A. Meduna 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 122 KB

The effective entropies of some extensio

The effective entropies of some extensions of context-free languages

✍ Dung T. Huynh 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Sequential extension of algorithmic lang

Sequential extension of algorithmic languages

✍ A. A. Letichevskii 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 475 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

On regularity of context-free languages

✍ A. Ehrenfeucht; D. Haussler; G. Rozenberg 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 112 KB

A generator of context-sensitive languag

A generator of context-sensitive languages

✍ Ben Wegbreit 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 252 KB

The existence of a context-sensitive grammar, G~, which acts as a "generator" of all context-sensitive languages is established. Specifically, G~ has the property that for each context-sensitive language, L, there exists a regular set, RL, and an e-limited gsm, gL, such that L = gz(L(G,,) ~ .RL). It