Video Lectures Help
Having trouble viewing lectures? Try changing players. Your current player format is html5. Change to flash.
- Completed 1. Course outline and motivation (15 min.)
- Completed
2. Informal introduction to finite automata (11 min.) ✐ Quiz Attempted
PPT for 2. Informal introduction to finite automata (11 min.)PDF for 2. Informal introduction to finite automata (11 min.)Subtitles (text) for 2. Informal introduction to finite automata (11 min.)Subtitles (srt) for 2. Informal introduction to finite automata (11 min.)Video (MP4) for 2. Informal introduction to finite automata (11 min.)
- Completed 3. Deterministic finite automata (36 min.) ✐ Quiz Attempted
-
4. Nondeterministic finite automata (46 min.)
PPT for 4. Nondeterministic finite automata (46 min.)PDF for 4. Nondeterministic finite automata (46 min.)Subtitles (text) for 4. Nondeterministic finite automata (46 min.)Subtitles (srt) for 4. Nondeterministic finite automata (46 min.)Video (MP4) for 4. Nondeterministic finite automata (46 min.)
- 5. Regular expressions (38 min.)
-
6. Regular expressions in the real world (17 min.)
PPT for 6. Regular expressions in the real world (17 min.)PDF for 6. Regular expressions in the real world (17 min.)Subtitles (text) for 6. Regular expressions in the real world (17 min.)Subtitles (srt) for 6. Regular expressions in the real world (17 min.)Video (MP4) for 6. Regular expressions in the real world (17 min.)
-
7. Decision algorithms for regular languages (41 min.)
PPT for 7. Decision algorithms for regular languages (41 min.)PDF for 7. Decision algorithms for regular languages (41 min.)Subtitles (text) for 7. Decision algorithms for regular languages (41 min.)Subtitles (srt) for 7. Decision algorithms for regular languages (41 min.)Video (MP4) for 7. Decision algorithms for regular languages (41 min.)
-
8. Closure properties of regular languages (20 min.)
PPT for 8. Closure properties of regular languages (20 min.)PDF for 8. Closure properties of regular languages (20 min.)Subtitles (text) for 8. Closure properties of regular languages (20 min.)Subtitles (srt) for 8. Closure properties of regular languages (20 min.)Video (MP4) for 8. Closure properties of regular languages (20 min.)
-
9. Introduction to context-free grammars (27 min.)
PPT for 9. Introduction to context-free grammars (27 min.)PDF for 9. Introduction to context-free grammars (27 min.)Subtitles (text) for 9. Introduction to context-free grammars (27 min.)Subtitles (srt) for 9. Introduction to context-free grammars (27 min.)Video (MP4) for 9. Introduction to context-free grammars (27 min.)
- 10. Parse trees (26 min.)
-
11. Normal forms for context-free grammars (27 min.)
PPT for 11. Normal forms for context-free grammars (27 min.)PDF for 11. Normal forms for context-free grammars (27 min.)Subtitles (text) for 11. Normal forms for context-free grammars (27 min.)Subtitles (srt) for 11. Normal forms for context-free grammars (27 min.)Video (MP4) for 11. Normal forms for context-free grammars (27 min.)
- 12. Pushdown automata (24 min.)
- 13. Equivalence of PDA's and CFG's (18 min.)
- 14. The pumping lemma for CFL's (12 min.)
-
15. Decision and closure properties for CFL's (35 min.)
PPT for 15. Decision and closure properties for CFL's (35 min.)PDF for 15. Decision and closure properties for CFL's (35 min.)Subtitles (text) for 15. Decision and closure properties for CFL's (35 min.)Subtitles (srt) for 15. Decision and closure properties for CFL's (35 min.)Video (MP4) for 15. Decision and closure properties for CFL's (35 min.)
- 16. Turing machines (34 min.)
-
17. Extensions and properties of Turing machines (37 min.)
PPT for 17. Extensions and properties of Turing machines (37 min.)PDF for 17. Extensions and properties of Turing machines (37 min.)Subtitles (text) for 17. Extensions and properties of Turing machines (37 min.)Subtitles (srt) for 17. Extensions and properties of Turing machines (37 min.)Video (MP4) for 17. Extensions and properties of Turing machines (37 min.)
- 18. Decidability (18 min.)
- 19. Specific undecidable problems (56 min.)
- 20. P and NP (25 min.)
-
21. Satisfiability and Cook's theorem (44 min.)
PPT for 21. Satisfiability and Cook's theorem (44 min.)PDF for 21. Satisfiability and Cook's theorem (44 min.)Subtitles (text) for 21. Satisfiability and Cook's theorem (44 min.)Subtitles (srt) for 21. Satisfiability and Cook's theorem (44 min.)Video (MP4) for 21. Satisfiability and Cook's theorem (44 min.)
- 22. Specific NP-complete problems (33 min.)