PRESENTED BY –

CRASY BOSE
AYUSH KEDIA
KRITI GUPTA
COMPUTER SCIENCE AND ENGINEERING DEPARTMENT
2ND YEAR , 4TH SEMESTER
 CONTENTS
>> INTRODUCTION
>> REGULAR LANGUAGE AND REGULAR GRAMMAR HIERARCHY
>> REGULAR SET
>> REGULAR EXPRESSION
>> PUMPING LEMMA
>> CONCLUSION
>> ACKNOWLEDGEMENT
>> BIBLIOGRAPHY
PRESENTATION ON -

REGULAR LANGUAGE
AND
REGULAR GRAMMAR
 INTRODUCTION
REGULAR LANGUAGE –
In theoretical computer science and formal language theory,a regular language is –
>> a formal language
>> can be expressed using a regular expression
>> also known as rational language
REGULAR GRAMMAR -
In theoretical computer science and formal language,a regular grammar is - 
>> a formal grammar
>> that describes a regular language
REGULAR LANGUAGE HIERARCHY
REGULAR GRAMMAR HIERARCHY
 REGULAR SET
Any set that represents the value of the Regular Expression is called a Regular Set.
PROPERTIES OF REGULAR SET

Property 1) The union of two regular sets is also a regular set.

Property 2) The intersection of two regular set is also a regular set.
Property 3) The complement of a regular set is also regular set.
Property 4) The difference of two regular set is also a regular set.
Property 5) The reversal of a regular set is also a regular set.
Property 6) The closure of a regular set or an expression is also a regular set.
Property 7) The concatenation of two regular sets is also a regular set.
 REGULAR EXPRESSION
A regular expression, regex or regexp(sometimes called a rational expression) -
>> is a sequence of characters defining a search pattern
>> usually used by string searching algorihm
REGULAR EXPRESSION
AND
REGULAR SET EXAMPLES
 PUMPING LEMMA
In the theory of formal languages, the pumping lemma may refer to -
>> Pumping lemma for regular languages.
>> Pumping lemma for context-free languages.
>> Pumping lemma for indexed languages.
>> Pumping lemma for regular tree languages.
USE OF PUMPING LEMMA
The pumping lemma is often used to -
>> prove that a particular language is non-regular
>> exhibiting a word (of the required length) in the language that lacks the
property outlined in the pumping lemma.
 APPLICATION OF
PUMPING LEMMA
Pumping Lemma is to be applied to show that certain languages are not regular. It should
never be used to show a language is regular.
>> If L is regular, it satisfies Pumping Lemma.
>> If L does not satisfy Pumping Lemma, it is non-regular.
PUMPING LEMMA DFA
PUMPING LEMMA FOR
REGULAR GRAMMAR
Theorem
If L is considered as a regular language. Then there exists a constant ‘c’ such that for
every string w in L −
|w| ≥ c
Let’s break w into three strings, w = xyz, such that −
>> |y| > 0
>> |xy| ≤ c
For all k ≥ 0, the string xykz is also in L.
 CONCLUSION
Since regular grammars are a special type of grammar, it is reasonable to assume
that the set of regular languages is a subset of all possible languages.
 ACKNOWLEDGEMENT
WE WOULD LIKE TO GIVE OUR SPECIAL THANKS OF GRATITUDE TO OUR
TEACHER MR.JOYDEB MONDAL FOR GIVING US THIS WONDERFUL TOPIC
FOR PRESENTATION.
WE HAVE DONE A LOT OF RESEARCH ON THE TOPIC AND HAVE COME TO
KNOW A LOT OF THINGS ABOUT IT.THIS HAS REALLY HELPED US A LOT.
 BIBLIOGRAPHY
>> www.google.com
>> www.Wikipedia.com
>> www.geeksforgeeks.org
>> www.tutorialspoint.com
THANK YOU