![[ICO]](/icons/blank.gif) | Name | Last modified | Size | Description |
|
![[PARENTDIR]](/icons/back.gif) | Parent Directory | | - | |
![[TXT]](/icons/text.gif) | 1. Introduction, Finite Automata, Regular Expressions-9syvZr-9xwk.en.srt | 2022-07-28 16:02 | 177K | |
![[TXT]](/icons/text.gif) | 1. Introduction, Finite Automata, Regular Expressions-9syvZr-9xwk.en.vtt | 2022-07-28 15:59 | 214K | |
![[TXT]](/icons/text.gif) | 2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA-oNsscmUwjMU.en.srt | 2022-08-02 10:52 | 173K | |
![[TXT]](/icons/text.gif) | 2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA-oNsscmUwjMU.en.vtt | 2022-07-28 15:59 | 210K | |
![[TXT]](/icons/text.gif) | 3. Regular Pumping Lemma, Conversion of FA to Regular Expressions-KAySmSEGc9U.en.srt | 2022-08-02 10:52 | 247K | |
![[TXT]](/icons/text.gif) | 3. Regular Pumping Lemma, Conversion of FA to Regular Expressions-KAySmSEGc9U.en.vtt | 2022-07-28 15:59 | 289K | |
![[TXT]](/icons/text.gif) | 4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion-m9eHViDPAJQ.en.srt | 2022-08-02 10:52 | 140K | |
![[TXT]](/icons/text.gif) | 4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion-m9eHViDPAJQ.en.vtt | 2022-07-28 15:59 | 182K | |
![[TXT]](/icons/text.gif) | 5. CF Pumping Lemma, Turing Machines-IycOPFmEQk8.en.srt | 2022-08-02 10:52 | 213K | |
![[TXT]](/icons/text.gif) | 5. CF Pumping Lemma, Turing Machines-IycOPFmEQk8.en.vtt | 2022-07-28 15:59 | 258K | |
![[TXT]](/icons/text.gif) | 6. TM Variants, Church-Turing Thesis-TTArY7ojshU.en.srt | 2022-08-02 10:52 | 213K | |
![[TXT]](/icons/text.gif) | 6. TM Variants, Church-Turing Thesis-TTArY7ojshU.en.vtt | 2022-07-28 15:59 | 258K | |
![[TXT]](/icons/text.gif) | 7. Decision Problems for Automata and Grammars-4MgN6uxd4i4.en.srt | 2022-08-02 10:52 | 211K | |
![[TXT]](/icons/text.gif) | 7. Decision Problems for Automata and Grammars-4MgN6uxd4i4.en.vtt | 2022-07-28 15:59 | 257K | |
![[TXT]](/icons/text.gif) | 8. Undecidability-3PzuSPQPEU4.en.srt | 2022-08-02 10:52 | 276K | |
![[TXT]](/icons/text.gif) | 8. Undecidability-3PzuSPQPEU4.en.vtt | 2022-07-28 15:59 | 321K | |
![[TXT]](/icons/text.gif) | 9. Reducibility-N28g_YBXY8Y.en.srt | 2022-08-02 10:52 | 148K | |
![[TXT]](/icons/text.gif) | 9. Reducibility-N28g_YBXY8Y.en.vtt | 2022-07-28 15:59 | 194K | |
![[TXT]](/icons/text.gif) | 10. Computation History Method-MGqoLm2aAgc.en.srt | 2022-08-02 10:52 | 222K | |
![[TXT]](/icons/text.gif) | 10. Computation History Method-MGqoLm2aAgc.en.vtt | 2022-07-28 16:00 | 271K | |
![[TXT]](/icons/text.gif) | 11. Recursion Theorem and Logic-N-_XmLanPYg.en.srt | 2022-08-02 10:52 | 211K | |
![[TXT]](/icons/text.gif) | 11. Recursion Theorem and Logic-N-_XmLanPYg.en.vtt | 2022-07-28 16:00 | 259K | |
![[TXT]](/icons/text.gif) | 12. Time Complexity-asjAc90L8rE.en.srt | 2022-08-02 10:52 | 237K | |
![[TXT]](/icons/text.gif) | 12. Time Complexity-asjAc90L8rE.en.vtt | 2022-07-28 16:00 | 289K | |
![[TXT]](/icons/text.gif) | 14. P and NP, SAT, Poly-Time Reducibility-1VhnDdQsELo.en.srt | 2022-08-02 10:52 | 216K | |
![[TXT]](/icons/text.gif) | 14. P and NP, SAT, Poly-Time Reducibility-1VhnDdQsELo.en.vtt | 2022-07-28 16:00 | 264K | |
![[TXT]](/icons/text.gif) | 15. NP-Completeness-iZPzBHGDsWI.en.srt | 2022-08-02 10:52 | 233K | |
![[TXT]](/icons/text.gif) | 15. NP-Completeness-iZPzBHGDsWI.en.vtt | 2022-07-28 16:00 | 285K | |
![[TXT]](/icons/text.gif) | 16. Cook-Levin Theorem-6Az1gtDRaAU.en.srt | 2022-08-02 10:52 | 209K | |
![[TXT]](/icons/text.gif) | 16. Cook-Levin Theorem-6Az1gtDRaAU.en.vtt | 2022-07-28 16:00 | 256K | |
![[TXT]](/icons/text.gif) | 17. Space Complexity, PSPACE, Savitch's Theorem-cT_qwkTigv4.en.srt | 2022-08-02 10:52 | 155K | |
![[TXT]](/icons/text.gif) | 17. Space Complexity, PSPACE, Savitch's Theorem-cT_qwkTigv4.en.vtt | 2022-07-28 16:00 | 202K | |
![[TXT]](/icons/text.gif) | 18. PSPACE-Completeness-aVv9WXwW95w.en.srt | 2022-08-02 10:52 | 206K | |
![[TXT]](/icons/text.gif) | 18. PSPACE-Completeness-aVv9WXwW95w.en.vtt | 2022-07-28 16:00 | 252K | |
![[TXT]](/icons/text.gif) | 19. Games, Generalized Geography-4dFPVJrNLDs.en.srt | 2022-08-02 10:52 | 218K | |
![[TXT]](/icons/text.gif) | 19. Games, Generalized Geography-4dFPVJrNLDs.en.vtt | 2022-07-28 16:00 | 266K | |
![[TXT]](/icons/text.gif) | 20. L and NL, NL = coNL-q3xvno_KgRY.en.srt | 2022-08-02 10:52 | 277K | |
![[TXT]](/icons/text.gif) | 20. L and NL, NL = coNL-q3xvno_KgRY.en.vtt | 2022-07-28 16:00 | 325K | |
![[TXT]](/icons/text.gif) | 21. Hierarchy Theorems-vqFRAWeEcUs.en.srt | 2022-08-02 10:52 | 224K | |
![[TXT]](/icons/text.gif) | 21. Hierarchy Theorems-vqFRAWeEcUs.en.vtt | 2022-07-28 16:00 | 274K | |
![[TXT]](/icons/text.gif) | 22. Provably Intractable Problems, Oracles-N32bnUliSzo.en.srt | 2022-08-02 10:52 | 227K | |
![[TXT]](/icons/text.gif) | 22. Provably Intractable Problems, Oracles-N32bnUliSzo.en.vtt | 2022-07-28 16:00 | 278K | |
![[TXT]](/icons/text.gif) | 23. Probabilistic Computation, BPP-Vp_AzDGQyrA.en.srt | 2022-08-02 10:52 | 230K | |
![[TXT]](/icons/text.gif) | 23. Probabilistic Computation, BPP-Vp_AzDGQyrA.en.vtt | 2022-07-28 16:00 | 281K | |
![[TXT]](/icons/text.gif) | 24. Probabilistic Computation (cont.)-7J1HD9rqEB4.en.srt | 2022-08-02 10:52 | 227K | |
![[TXT]](/icons/text.gif) | 24. Probabilistic Computation (cont.)-7J1HD9rqEB4.en.vtt | 2022-07-28 16:00 | 278K | |
![[TXT]](/icons/text.gif) | 25. Interactive Proof Systems, IP-TSI3LR5WZmo.en.srt | 2022-08-02 10:52 | 255K | |
![[TXT]](/icons/text.gif) | 25. Interactive Proof Systems, IP-TSI3LR5WZmo.en.vtt | 2022-07-28 16:00 | 300K | |
![[TXT]](/icons/text.gif) | 26. coNP is a subset of IP-eEXSv0jChO4.en.srt | 2022-08-02 10:52 | 289K | |
![[TXT]](/icons/text.gif) | 26. coNP is a subset of IP-eEXSv0jChO4.en.vtt | 2022-07-28 16:00 | 340K | |
|