Scribd
Upload
12 views4 pages

YOGI

HJVBKBHK

Uploaded by

prasannamt2019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views4 pages

YOGI

HJVBKBHK

Uploaded by

prasannamt2019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

VI SV E S VARAYA TE CHNOLOGICA L U NIVERSITY

“J N A N A S A N G A M A” B E L A G A VI – 5 9 0 0 1 8

BACHELOR OF ENGINEERING
IN
INFORMATION SCIENCE AND ENGINEERING

THEORY OF COMPUTATION SEMINAR REPORT

ON

“PUMPING LEMMA FOR REGULAR LANGUAGES”


SUBMITTED BY

YOGESHWARAYA BS

[4GM23IS405]

COURSE COORDINATOR HEAD OF THE DEPARTMENT


Mr. Imran Khan Dr. Neelambike S
B.E, MTech., (Ph.D.) B.E, MTech., M.B.A., Ph D., M.I.S.T.E
Assistant Professor Professor & Head
PUMPING LEMMA FOR REGULAR LANGUAGES”

The Pumping Lemma for Regular Languages is a fundamental theorem in formal


language theory. It provides a necessary condition for a language to be regular.
While it can't prove that a language is regular, it can effectively prove that a
language is not regular.

The Core Idea


* Finite Automata and Loops: Regular languages are recognized by finite automata. In
a finite automaton, if a string is sufficiently long, it must cause the automaton to revisit
a previously visited state. This creates a loop in the automaton's execution.
* Pumping: The string can be "pumped" by repeating the loop any number of times,
creating new strings that are also accepted by the automaton.

Formal Statement
If L is a regular language, then there exists a positive integer p (the "pumping length")
such that for every string w in L with |w| ≥ p, w can be divided into three substrings x, y,
and z (i.e., w = xyz) satisfying the following conditions:
* |y| > 0: The substring y is not empty.
* |xy| ≤ p: The combined length of x and y is at most p.
* For all i ≥ 0, xy<sup>i</sup>z ∈ L: The string w can be "pumped" by repeating y any
number of times (including zero times), and the resulting string will still be in L.

How to Use the Pumping Lemma to Prove a Language is Not Regular


* Assume L is Regular: Start by assuming that the language L is regular.
* Choose a Pumping Length: The pumping lemma guarantees the existence of a
pumping length p. You don't need to know the exact value of p; you can simply choose
a value that will help you demonstrate a contradiction.
* Select a String: Choose a string w in L that is longer than the pumping length p (|w| ≥
p). This string must be carefully chosen to exhibit the non-regularity of the language.
* Divide the String: Divide w into x, y, and z according to the pumping lemma's
2
conditions.
* Pump the String: Choose a value for i (usually i = 0 or i = 2) and pump the string to
create xy<sup>i</sup>z.
* Show that xy<sup>i</sup>z ∉ L: Demonstrate that the pumped string
xy<sup>i</sup>z does not belong to the language L. This contradiction proves that the
initial assumption (L is regular) was false.

Example
Let's prove that the language L = {a<sup>n</sup>b<sup>n</sup> | n ≥ 0} is not regular
using the pumping lemma.
* Assume L is Regular: Assume L is regular.
* Choose a Pumping Length: Let p be the pumping length.
* Select a String: Choose w = a<sup>p</sup>b<sup>p</sup>.
* Divide the String: According to the pumping lemma, w can be divided into x, y, and z
such that |xy| ≤ p and |y| > 0. Since |xy| ≤ p, y must consist only of as.
* Pump the String: Let i = 0. Then, xy<sup>0</sup>z = xz = a<sup>p-
|y|</sup>b<sup>p</sup>.
* Show that xy<sup>i</sup>z ∉ L: Since y consists only of as, xz has fewer as than bs.
Therefore, xz ∉ L, which contradicts the pumping lemma.
This contradiction proves that our initial assumption (L is regular) is false. Hence, L =
{a<sup>n</sup>b<sup>n</sup> | n ≥ 0} is not a regular language.

Key Points
* The pumping lemma is a powerful tool for proving that a language is not regular.
* It cannot be used to prove that a language is regular.
* The choice of the string w is crucial for a successful proof.
By understanding and applying the pumping lemma, you can effectively analyze the
properties of formal languages and determine their regularity.

3
4

You might also like