1. Introduction, Finite Automata, 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...
Introduction; course outline, mechanics, and expectations. Described finite automata, their formal definition, regular languages, regular operations, and regular expressions. Proved that the class of regular languages is closed under union. Started proving closure under concatenation.
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.
Watch video 1. Introduction, Finite Automata, Regular Expressions online without registration, duration hours minute second in high quality. This video was added by user MIT OpenCourseWare 06 October 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 352,273 once and liked it 5 thousand people.