Pumping Lemma for CFL and Applications

Content

Pumping Lemma

What is CFL

Proof using Parse Tree

Fig. 1
Fig. 2

Pumping Lemma in CFL

Example 1: L = {a^Nb^Nc^N|N>0}

Example 2: L={ ww | w ∈ {0,1}*}

Applications

1.XML Parsing

2. Pumping lemma is used while playing games.

3. At power stations this pumping lemma is used.

Contributes

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store