PushBT Magnet/Torrent

Categories

Recommend Tools

  • Convert torrent to magnet
  • Convert torrent to magnet

fileCoursera-Autota-XN3w

Coursera Autota
  • MP405 - Week 5 Turing chines and Undecidability03 - 19. Specific undecidable problems (56 min.)5 - 3 - 19. Specific undecidable problems (56 min.).mp462.40MB
  • MP401 - Week 1 Finite Autota04 - 4. Nondeterministic finite automata (46 min.)1 - 4 - 4. Nondeterministic finite automata (46 min.).mp451.54MB
  • MP406 - Week 6 Intractable Problems and NP-completeness02 - 21. Satisfiability and Cooks theorem (44 min.)6 - 2 - 21. Satisfiability and Cooks theorem (44 min.).mp449.37MB
  • MP402 - Week 2 Regular Expression and Properties of Regular Languages03 - 7. Decision algorithms for regular languages (41 min.)2 - 3 - 7. Decision algorithms for regular languages (41 min.).mp446.73MB
  • MP402 - Week 2 Regular Expression and Properties of Regular Languages01 - 5. Regular expressions (38 min.)2 - 1 - 5. Regular expressions (38 min.).mp442.51MB
  • MP405 - Week 5 Turing chines and Undecidability01 - 17. Extensions and properties of Turing machines (37 min.)5 - 1 - 17. Extensions and properties of Turing machines (37 min.).mp441.50MB
  • MP401 - Week 1 Finite Autota03 - 3. Deterministic finite automata (36 min.)1 - 3 - 3. Deterministic finite automata (36 min.).mp440.34MB
  • MP404 - Week 4 Pushdown Autota and Properties of Context-Free Languages03 - 15. Decision and closure properties for CFLs (35 min.)4 - 3 - 15. Decision and closure properties for CFLs (35 min.).mp439.58MB
  • MP404 - Week 4 Pushdown Autota and Properties of Context-Free Languages04 - 16. Turing machines (34 min.)4 - 4 - 16. Turing machines (34 min.).mp438.22MB
  • MP406 - Week 6 Intractable Problems and NP-completeness03 - 22. Specific NP-complete problems (33 min.)6 - 3 - 22. Specific NP-complete problems (33 min.).mp436.64MB
  • MP403 - Week 3 Context-Free Gramrs and Pushdown Automata03 - 11. Normal forms for context-free grammars (27 min.)3 - 3 - 11. Normal forms for context-free grammars (27 min.).mp431.09MB
  • MP403 - Week 3 Context-Free Gramrs and Pushdown Automata01 - 9. Introduction to context-free grammars (27 min.)3 - 1 - 9. Introduction to context-free grammars (27 min.).mp430.46MB
  • MP403 - Week 3 Context-Free Gramrs and Pushdown Automata02 - 10. Parse trees (26 min.)3 - 2 - 10. Parse trees (26 min.).mp429.63MB
  • MP406 - Week 6 Intractable Problems and NP-completeness01 - 20. P and NP (25 min.)6 - 1 - 20. P and NP (25 min.).mp428.49MB
  • MP407 - Problem Session03 - Problem Session 37 - 3 - Problem Session 3.mp427.21MB
  • MP403 - Week 3 Context-Free Gramrs and Pushdown Automata04 - 12. Pushdown automata (24 min.)3 - 4 - 12. Pushdown automata (24 min.).mp426.69MB
  • MP402 - Week 2 Regular Expression and Properties of Regular Languages04 - 8. Closure properties of regular languages (20 min.)2 - 4 - 8. Closure properties of regular languages (20 min.).mp422.96MB
  • MP405 - Week 5 Turing chines and Undecidability02 - 18. Decidability (18 min.)5 - 2 - 18. Decidability (18 min.).mp420.78MB
  • MP404 - Week 4 Pushdown Autota and Properties of Context-Free Languages01 - 13. Equivalence of PDAs and CFGs (18 min.)4 - 1 - 13. Equivalence of PDAs and CFGs (18 min.).mp420.55MB
  • MP407 - Problem Sessio - Problem Session 17 - 1 - Problem Session 1.mp418.74MB
  • MP402 - Week 2 Regular Expression and Properties of Regular Languages02 - 6. Regular expressions in the real world (17 min.)2 - 2 - 6. Regular expressions in the real world (17 min.).mp418.64MB
  • MP401 - Week 1 Finite Autota01 - 1. Course outline and motivation (15 min.)1 - 1 - 1. Course outline and motivation (15 min.).mp417.09MB
  • MP404 - Week 4 Pushdown Autota and Properties of Context-Free Languages02 - 14. The pumping lemma for CFLs (12 min.)4 - 2 - 14. The pumping lemma for CFLs (12 min.).mp413.46MB
  • MP401 - Week 1 Finite Autota02 - 2. Informal introduction to finite automata (11 min.)1 - 2 - 2. Informal introduction to finite automata (11 min.).mp412.57MB
  • MP407 - Problem Session04 - Problem Session 47 - 4 - Problem Session 4.mp411.58MB
  • MP407 - Problem Session02 - Problem Session 27 - 2 - Problem Session 2.mp411.45MB
  • PPT01 - Week 1 Finite Autota02 - 2. Informal introduction to finite automata (11 min.)2_vfa.ppt296.00KB
  • PPT02 - Week 2 Regular Expression and Properties of Regular Languages03 - 7. Decision algorithms for regular languages (41 min.)7_rs1.ppt287.50KB
  • PPT07 - Problem Session02 - Problem Session 2problem-session-2.ppt275.00KB
  • PPT05 - Week 5 Turing chines and Undecidability03 - 19. Specific undecidable problems (56 min.)19_tm4.ppt229.00KB
  • PDF01 - Week 1 Finite Autota02 - 2. Informal introduction to finite automata (11 min.)2_vfa1.pdf227.17KB
  • PPT01 - Week 1 Finite Autota03 - 3. Deterministic finite automata (36 min.)3_fa2.ppt220.00KB
  • PDF02 - Week 2 Regular Expression and Properties of Regular Languages03 - 7. Decision algorithms for regular languages (41 min.)7_rs1.pdf212.39KB
  • PPT04 - Week 4 Pushdown Autota and Properties of Context-Free Languages04 - 16. Turing machines (34 min.)16_tm1.ppt203.00KB
  • PPT05 - Week 5 Turing chines and Undecidability01 - 17. Extensions and properties of Turing machines (37 min.)17_tm2.ppt201.00KB
  • PDF05 - Week 5 Turing chines and Undecidability03 - 19. Specific undecidable problems (56 min.)19_tm4.pdf190.22KB
  • PDF05 - Week 5 Turing chines and Undecidability01 - 17. Extensions and properties of Turing machines (37 min.)17_tm2.pdf177.11KB
  • PDF01 - Week 1 Finite Autota03 - 3. Deterministic finite automata (36 min.)3_fa2.pdf174.45KB
  • PPT01 - Week 1 Finite Autota04 - 4. Nondeterministic finite automata (46 min.)4_fa3.ppt172.50KB
  • PPT06 - Week 6 Intractable Problems and NP-completeness02 - 21. Satisfiability and Cooks theorem (44 min.)21_pnp2.ppt172.50KB
  • PPT03 - Week 3 Context-Free Gramrs and Pushdown Automata01 - 9. Introduction to context-free grammars (27 min.)9_cfl1.ppt167.00KB
  • PPT06 - Week 6 Intractable Problems and NP-completeness03 - 22. Specific NP-complete problems (33 min.)22_pnp3.ppt164.00KB
  • PDF04 - Week 4 Pushdown Autota and Properties of Context-Free Languages04 - 16. Turing machines (34 min.)16_tm1.pdf152.12KB
  • PPT03 - Week 3 Context-Free Gramrs and Pushdown Automata04 - 12. Pushdown automata (24 min.)12_pda1.ppt147.00KB
  • PPT04 - Week 4 Pushdown Autota and Properties of Context-Free Languages03 - 15. Decision and closure properties for CFLs (35 min.)15_cfl5.ppt147.00KB
  • PDF01 - Week 1 Finite Autota04 - 4. Nondeterministic finite automata (46 min.)4_fa3.pdf145.67KB
  • PDF07 - Problem Session02 - Problem Session 2problem-session-2.pdf143.93KB
  • PDF03 - Week 3 Context-Free Gramrs and Pushdown Automata02 - 10. Parse trees (26 min.)10_cfl2.pdf138.44KB
  • PDF07 - Problem Session03 - Problem Session roblem-session-3.pdf137.74KB
  • PPT03 - Week 3 Context-Free Gramrs and Pushdown Automata03 - 11. Normal forms for context-free grammars (27 min.)11_cfl3.ppt136.00KB
  • PDF02 - Week 2 Regular Expression and Properties of Regular Languages01 - 5. Regular expressions (38 min.)5_re1.pdf135.73KB
  • PDF06 - Week 6 Intractable Problems and NP-completeness03 - 22. Specific NP-complete problems (33 min.)22_pnp3.pdf135.17KB
  • PDF06 - Week 6 Intractable Problems and NP-completeness02 - 21. Satisfiability and Cooks theorem (44 min.)21_pnp2.pdf134.54KB
  • PPT03 - Week 3 Context-Free Gramrs and Pushdown Automata02 - 10. Parse trees (26 min.)10_cfl2.ppt134.50KB
  • PDF04 - Week 4 Pushdown Autota and Properties of Context-Free Languages03 - 15. Decision and closure properties for CFLs (35 min.)15_cfl5.pdf130.34KB
  • PPT02 - Week 2 Regular Expression and Properties of Regular Languages01 - 5. Regular expressions (38 min.)5_re1.ppt127.50KB
  • PPT02 - Week 2 Regular Expression and Properties of Regular Languages04 - 8. Closure properties of regular languages (20 min.)8_rs2.ppt125.50KB
  • PDF03 - Week 3 Context-Free Gramrs and Pushdown Automata03 - 11. Normal forms for context-free grammars (27 min.)11_cfl3.pdf122.71KB
  • PDF03 - Week 3 Context-Free Gramrs and Pushdown Automata04 - 12. Pushdown automata (24 min.)12_pda1.pdf121.54KB
  • PPT07 - Problem Session03 - Problem Session roblem-session-3.ppt121.50KB
  • PPT06 - Week 6 Intractable Problems and NP-completeness01 - 20. P and NP (25 min.)20_pnp1.ppt119.00KB
  • PPT04 - Week 4 Pushdown Autota and Properties of Context-Free Languages01 - 13. Equivalence of PDAs and CFGs (18 min.)13_pda2.ppt113.00KB
  • PPT05 - Week 5 Turing chines and Undecidability02 - 18. Decidability (18 min.)18_tm3.ppt103.50KB
  • PDF06 - Week 6 Intractable Problems and NP-completeness01 - 20. P and NP (25 min.)20_pnp1.pdf101.08KB
  • PDF02 - Week 2 Regular Expression and Properties of Regular Languages04 - 8. Closure properties of regular languages (20 min.)8_rs2.pdf99.33KB
Latest Search: 1.BOMN-041   2.DSKM-070   3.KTDS-221   4.DJSG-075   5.KWBD-050   6.DIR-30   7.DOKS-275   8.TMDI-032   9.RNADE-078   10.NATR-169   11.DRS-031   12.ARD-045   13.NTT-001   14.A-002   15.LIA-411   16.EMAD-106   17.BOG-630R   18.DMM-109   19.ID-049   20.BNDV-332   21.OZVD-209   22.UD-627R   23.ANB-71   24.GVG-029   25.ARM-389   26.HAR-004   27.PGD-847   28.MVSD-290   29.ANX-072   30.JMD-131   31.SILKC-103   32.OKAX-281   33.JUEM-010   34.SRD-42   35.MW-034   36.MDTM-365   37.YST-168   38.DXDB-036   39.OAE-180   40.SKMJ-048   41.JFB-201   42.HMD-040   43.546   44.477   45.048   46.380   47.251   48.031   49.068   50.007   51.023   52.787   53.00723   54.001   55.418   56.384Z   57.138   58.092   59.271   60.003   61.882   62.007   63.017   64.065   65.3022   66.054   67.239   68.136   69.2031   70.886   71.047   72.267   73.322   74.210   75.194   76.021   77.143   78.015   79.502   80.083   81.265