✦ LIBER ✦

A note on parsing pattern languages

✍ Scribed by Oscar H. Ibarra; Ting-Chuen Pong; Stephen M. Sohn

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 296 KB
Volume: 16
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(94)00091-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pallel parsing of tree languages for syn

Pallel parsing of tree languages for syntactic pattern recognition

✍ Ning-San Chang; King-Sun Fu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 636 KB

A Polynomial-Time Parsing Algorithm forK

A Polynomial-Time Parsing Algorithm forK-Depth Languages

✍ Alessandra Cherubini; Pierluigi San Pietro 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 736 KB

K-depth grammars extend context-free grammars allowing k 1 rewriting points for a single non-terminal at every step of a derivation. The family of languages generated by k-depth grammars is a proper extension of the family of context-free languages, while retaining many context-free properties, such

Note on fuzzy languages

✍ E.T. Lee; L.A. Zadeh 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 834 KB

A note on context-free languages

✍ R.F.C. Walters 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A note on ω-regular languages

✍ Masako Takahashi; Hideki Yamasaki 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 647 KB

On the complexity of parallel parsing of

On the complexity of parallel parsing of general context-free languages

✍ Wojciech Rytter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 409 KB