𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence results about context-free languages and lower bounds

✍ Scribed by Juris Hartmanis

Book ID
113162755
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
575 KB
Volume
20
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds on size and independence in
Lower bounds on size and independence inK4-free graphs
✍ Fraughnaugh, Kathryn L.; Locke, Stephen C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 1 views

We investigate lower bounds on the size of K 4 -free graphs. For several ranges of independence relative to order and for graphs with maximum degree 3 and 4, we find sharp lower bounds. We also evaluate Ramsey-type numbers over the classes of graphs with maximum degree 3 and with maximum degree 4.

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