Presented by - : Crasy Bose Ayush Kedia Kriti Gupta
Presented by - : Crasy Bose Ayush Kedia Kriti Gupta
Presented by - : Crasy Bose Ayush Kedia Kriti Gupta
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