✦ LIBER ✦

Descriptional complexity of semi-conditional grammars

✍ Scribed by Tomáš Masopust; Alexander Meduna

Book ID: 108153523
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 99 KB
Volume: 104
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.05.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the descriptional complexity o

A note on the descriptional complexity of semi-conditional grammars

✍ Fumiya Okubo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Descriptional complexity of multi-parall

Descriptional complexity of multi-parallel grammars

✍ Tomáš Masopust 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 109 KB

On the descriptional complexity of scatt

On the descriptional complexity of scattered context grammars

✍ Tomáš Masopust 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 369 KB

A variant of random context grammars: Se

A variant of random context grammars: Semi-conditional grammars

✍ Gheorghe Pǎun 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 881 KB

A simultaneous reduction of several meas

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

✍ H. Fernau; A. Meduna 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 KB

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with a reduced number of both nonterminals and context-sensing productions.

Unary Context-Free Grammars and Pushdown

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds

✍ Giovanni Pighizzini; Jeffrey Shallit; Ming-wei Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 240 KB

It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity poi