4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion

Подробнее о видео

MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course:
YouTube Playlist:

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.

License: Creative Commons BY-NC-SA
More information at
More courses at
Support OCW at

We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at .