✦ LIBER ✦

Nonterminal complexity of tree controlled grammars

✍ Scribed by S. Turaev; J. Dassow; M. Selamat

Book ID: 113927473
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 231 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Language classes generated by tree contr

Language classes generated by tree controlled grammars with bounded nonterminal complexity

✍ Sherzod Turaev; Jürgen Dassow; Florin Manea; Mohd Hasan Selamat 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Nonterminal complexity of programmed gra

Nonterminal complexity of programmed grammars

✍ Henning Fernau 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We show that, in the case of context-free programmed grammars with appearance checking working under free derivations, three nonterminals are enough to generate every recursively enumerable language. This improves the previously published bound of eight for the nonterminal complexity of these gramma

Nonterminal complexity of one-sided rand

Nonterminal complexity of one-sided random context grammars

✍ Alexander Meduna; Petr Zemek 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

Tree controlled grammars

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

On the generative capacity of tree contr

On the generative capacity of tree controlled grammars

✍ Gh. Paun 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 358 KB

Elimination of single productions and me

Elimination of single productions and merging nonterminal symbols of LR(1) grammars

✍ A.J. Demers 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 952 KB