Lower bounds for context-free grammars

Yuval Filmus

doi:10.1016/j.ipl.2011.06.006

Lower bounds for context-free grammars

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	895-898
Number of pages	4
Journal	Information Processing Letters
Volume	111
Issue number	18
DOIs	https://doi.org/10.1016/j.ipl.2011.06.006
State	Published - 30 Sep 2011
Externally published	Yes

Keywords

Context-free grammars
Formal languages
Lower bounds

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2011.06.006

Cite this

@article{585f1b36e96844afb6b230ecac430fd1,

title = "Lower bounds for context-free grammars",

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.",

keywords = "Context-free grammars, Formal languages, Lower bounds",

author = "Yuval Filmus",

note = "Funding Information: E-mail address: [email protected]. 1 Supported by NSERC.",

year = "2011",

month = sep,

day = "30",

doi = "10.1016/j.ipl.2011.06.006",

language = "الإنجليزيّة",

volume = "111",

pages = "895--898",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "18",

}

TY - JOUR

T1 - Lower bounds for context-free grammars

AU - Filmus, Yuval

N1 - Funding Information: E-mail address: [email protected]. 1 Supported by NSERC.

PY - 2011/9/30

Y1 - 2011/9/30

N2 - 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.

AB - 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.

KW - Context-free grammars

KW - Formal languages

KW - Lower bounds

UR - http://www.scopus.com/inward/record.url?scp=79959630117&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2011.06.006

DO - 10.1016/j.ipl.2011.06.006

M3 - مقالة

SN - 0020-0190

VL - 111

SP - 895

EP - 898

JO - Information Processing Letters

JF - Information Processing Letters

IS - 18

ER -

Lower bounds for context-free grammars

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this