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: https://ocw.mit.edu/18-404JF20
YouTube Playlist: • MIT 18.404J Theory of Computation, Fa...
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 https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ
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 https://ocw.mit.edu/comments.
In questa pagina del sito puoi guardare il video online 3. Regular Pumping Lemma, Conversion of FA to Regular Expressions della durata di ore minuti seconda in buona qualità , che l'utente ha caricato MIT OpenCourseWare 06 ottobre 2021, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 72,992 volte e gli è piaciuto 901 spettatori. Buona visione!
