MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: [ Ссылка ]
YouTube Playlist: [ Ссылка ]
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 [ Ссылка ]
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 [ Ссылка ].
