Video Lectures
Lecture 7: Decision Problems for Automata and Grammars
Description: Quickly reviewed last lecture. Showed the decidability of various problems about automata and grammars: \(A\)DFA, \(A\)NFA, \(E\)DFA, \(EQ\)DFA, and \(A\)CFG. Also showed that \(A\)TM is T-recognizable.
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