𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Descriptional complexity of multi-parallel grammars

✍ Scribed by Tomáš Masopust

Book ID
108154566
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
109 KB
Volume
108
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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