pumping lemma

Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.

1. 1▶1. Introduction, Finite Automata, Regular ExpressionsMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
2. 2▶5. CF Pumping Lemma, Turing MachinesMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
3. 3▶3. Regular Pumping Lemma, Conversion of FA to Regular ExpressionsMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
4. 4▶9. ReducibilityMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
5. 5▶14. P and NP, SAT, Poly-Time ReducibilityMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
6. 6▶7. Decision Problems for Automata and GrammarsMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
7. 7▶12. Time ComplexityMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
8. 8▶6. TM Variants, Church-Turing ThesisMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
9. 9▶8. UndecidabilityMIT 18.404J Theory of Computation, Fall 2020Notes
   +Watch later
10. 10▶11. Recursion Theorem and LogicMIT 18.404J Theory of Computation, Fall 2020Notes
    +Watch later