Lower bounds for context-free grammars

Authors:
Yuval Filmus
Affiliations:
University of Toronto, Canada
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 0

On the Complexity of Optimal Grammar-Based Compression

DCC '06 Proceedings of the Data Compression Conference
Generating all permutations by context-free grammars in Chomsky normal form

Theoretical Computer Science - Algebraic methods in language processing
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
Generating all permutations by context-free grammars in Greibach normal form

Theoretical Computer Science
Generating all circular shifts by context-free grammars in Chomsky normal form

Journal of Automata, Languages and Combinatorics
The smallest grammar problem

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We generalize their method and obtain exponential lower bounds for many other languages, among them the set of all squares of given length, and the set of all words containing each symbol at most twice.