Pumping-Lemma

**1.**

Pumping lemma for context free grammar is used for

**2.**

Which of the following statement is false?

**3.**

Context free grammar is closed under

**4.**

CYK algorithm is named CYK because it was invented by

**5.**

The CYK algorithm start with

**6.**

Pumping lemma for context free language breaks the strings into

**7.**

In pumping lemma for context free language

**8.**

The CYK algorithm constructs table from where we can conclude whether w is in L

**9.**

The CYK algorithm is also known as

**10.**

Relate the following statement:

Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.