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

Publicado em: 06 Outubro 2021
no canal de: MIT OpenCourseWare

72,992

901

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.

Nesta página do site você pode assistir ao vídeo on-line 3. Regular Pumping Lemma, Conversion of FA to Regular Expressions duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário MIT OpenCourseWare 06 Outubro 2021, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 72,992 vezes e gostou 901 espectadores. Boa visualização!

37,384

1.6 mil

00:00:00