Video Lectures
Lecture 4: Pushdown Automata, CFG ↔ PDA
Description: Quickly reviewed last lecture. Defined context free grammars (CFGs) and context free languages (CFLs). Defined pushdown automata (PDA). Gave conversion of CFGs to PDAs. Stated the reverse conversion without proof.
Instructor: Prof. Michael Sipser
Course Info
Instructor
As Taught In
Fall
2020
Level
Topics
Learning Resource Types
edit_note
Editable Files
grading
Exams
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
assignment
Problem Sets
