MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: ocw.mit.edu/18-404JF20
KZitem Playlist: • MIT 18.404J Theory of ...
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 ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s KZitem and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.
Негізгі бет 4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
Пікірлер: 40