Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)
On the power of chain rules in context free grammars
For all n >- 2, we construct a context-free language Ln for which we prove the following:
Ln has a cfg of size O(n)
Any chain rule free cfg for Ln has size Ω(n log log n).
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1982