Lecture 3: Regular Pumping Lemma, Finite Automata → Regular Expressions, CFGs

Om kurset

Description: Quickly reviewed last lecture. Showed conversion of DFAs to regular expressions. Gave a method for proving languages not regular by using the pumping lemma and closure properties. Introduced context free grammars (CFGs). Instructor: Prof. Michael Sipser