Buy Dideo Subscription
Unlimited Access to Best Programming Courses @ http://bit.ly/2lJYuGH Theory of Computation (TOC) GATE lecture #12 Non-regular languages & Pumping Lemma. In this lecture we will talk about non regular languages and pumping lemma. We introduce a result known as pumping lemma which enables us to prove that certain languages are non-regular. There are, however, languages that are not regular and therefore require devices other than finite automata to recognize them. A language that cannot be defined by a regular expression is a nonregular language or an irregular language. Theory of Computation (TOC) & Automata Theory NPTEL Gate Lectures @ https://goo.gl/cyoofd C Programming Tutorial/ Lectures/ Course with Data Structures & Algorithms @ https://goo.gl/K6VbgL Machine Learning Complete Tutorial/Lectures/Course from IIT (nptel) for GATE @ https://goo.gl/AurRXm Discrete Mathematics for Computer Science for GATE @ https://goo.gl/YJnA4B (IIT Lectures for GATE) Best Programming Courses @ http://bit.ly/2lJYuGH Operating Systems Lecture/Tutorials ravindrababu ravula from IIT for GATE CSE @ https://goo.gl/GMr3if MATLAB Tutorials for GATE @ https://goo.gl/EiPgCF ******************************* Recommended Books: https://amzn.to/2PTjhqc https://clnk.in/jxr2 *****************************
