Video Lectures
Lecture 1: Introduction, Finite Automata, Regular Expressions
Viewing videos requires an internet connection
Description: 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 ⋃. Started proving closure under ◦.
Instructor: Prof. Michael Sipser
Course Info
Instructor
As Taught In
Fall
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment
Problem Sets
grading
Exams
notes
Lecture Notes
Instructor Insights
