✦ LIBER ✦

Tree grammars and languages

✍ Scribed by A. S. Modina

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 779 KB
Volume: 11
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071368

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disfluencies, language comprehension, an

Disfluencies, language comprehension, and Tree Adjoining Grammars

✍ Fernanda Ferreira; Ellen F. Lau; Karl G.D. Bailey 📂 Article 📅 2004 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 268 KB

Tree controlled grammars

✍ K. Culik; H. A. Maurer 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 551 KB

Tree Adjoining Languages and Multipushdo

Tree Adjoining Languages and Multipushdown Languages

✍ A. Cherubini; P. San Pietro 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 382 KB

The Equivalence of Tree Adjoining Gramma

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars

✍ Stephan Kepser; Jim Rogers 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 430 KB

Handle NLC grammars and R. E. languages

✍ Michael G. Main; Grzegorz Rozenberg 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 665 KB

Recursively enumerable languages and van

Recursively enumerable languages and van Wijngaarden grammars

✍ Jan Van Leeuwen 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 580 KB

We show that each re language can be generated by a minimal deterministic linear contextfree based strict normal VW-grammar. We also prove that each re language can be generated by a strict normal VW-grammar with at most one metanotion denoting a non-regular contextfree language.