Video Lectures
Lecture 2: Nondeterminism, Closure Properties, Regular Expressions → Finite Automata
Description: Quickly reviewed last lecture. Introduced nondeterministic finite automata (NFA). Proved that NFA and DFA are equivalent in power. Proved that the class of regular languages is closed under ◦, ∗. Showed conversion of regular expressions to NFAs.
Instructor: Prof. Michael Sipser
Viewing videos requires an internet connection
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