✦ LIBER ✦

Parallel context-free languages

✍ Scribed by Rani Siromoney; Kamala Krithivasan

Book ID: 114037051
Publisher: Elsevier Science
Year: 1974
Weight: 382 KB
Volume: 24
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)80054-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Sven Skyum 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 218 KB

Efficient parallel recognition of contex

Efficient parallel recognition of context-free languages

✍ Abhay Jain; N.S. Chaudhari 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 890 KB

Acceptors for isometric parallel context

Acceptors for isometric parallel context-free array languages

✍ Akira Nakamura; Kunio Aizawa 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 592 KB

On the parallel recognition of unambiguo

On the parallel recognition of unambiguous context-free languages

✍ Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Context-free fuzzy languages

✍ Eugene S. Santos 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 465 KB

Bracketed context-free languages

✍ Seymour Ginsburg; Michael A. Harrison 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection