MIT

Lecture 4: Pushdown Automata, CFG ↔ PDA

Data Science, Analytics & Computer TechnologyComputer ScienceScience & MathMathematicsEngineering

Om kurset

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