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

Подробнее о видео

MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course:
YouTube Playlist:

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).

License: Creative Commons BY-NC-SA
More information at
More courses at
Support OCW at

We 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 .