MIT OpenCourseWare: Free Courses from the institute podcast

3. Regular Pumping Lemma, Conversion of FA to Regular Expressions

0:00
1:16:46
Rewind 15 seconds
Fast Forward 15 seconds
MIT 18.404J Theory of Computation, Fall 2020Instructor: Michael SipserView the complete course: https://ocw.mit.edu/18-404JF20YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWYUploaded 06-10-21Quickly 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).License: Creative Commons BY-NC-SAMore information at https://ocw.mit.edu/termsMore courses at https://ocw.mit.eduSupport OCW at http://ow.ly/a1If50zVRlQWe encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments. Learn more about your ad choices. Visit megaphone.fm/adchoices Learn more about your ad choices. Visit megaphone.fm/adchoices

More episodes from "MIT OpenCourseWare: Free Courses from the institute"