𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Unary Context-Free Grammars and Pushdown
✍ 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