Abstract
For all n >- 2, we construct a context-free language Ln for which we prove the following:
-
a)
Ln has a cfg of size O(n)
-
b)
Any chain rule free cfg for Ln has size Ω(n log log n).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Harrison, M.A.: Introduction to formal language theory, Addison-Wesley (1978)
Yehudai, A.: On the complexity of grammer and language problems, Dissertation, Berkeley (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blum, N. (1982). On the power of chain rules in context free grammars. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012758
Download citation
DOI: https://doi.org/10.1007/BFb0012758
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive