Coursera / Stanford University - Automata : Theory of automata and grammars

seeders: 8
leechers: 0
Download torrent
Added on October 22, 2012 by NepsterJayin Books
Torrent verified.


Coursera / Stanford University - Automata : Theory of automata and grammars (Size: 798.65 MB)
 1 - 4 - 4. Nondeterministic finite automata (46 min.).mp451.54 MB
 1 - 3 - 3. Deterministic finite automata (36 min.).mp440.34 MB
 1 - 1 - 1. Course outline and motivation (15 min.).mp417.08 MB
 1 - 2 - 2. Informal introduction to finite automata (11 min.).mp412.58 MB
 2_vfa.ppt296 KB
 2_vfa1.pdf227.17 KB
 3_fa2.ppt220 KB
 3_fa2.pdf174.45 KB
 4_fa3.ppt172.5 KB
 4_fa3.pdf145.67 KB
 2 - 3 - 7. Decision algorithms for regular languages (41 min.).mp446.73 MB
 2 - 1 - 5. Regular expressions (38 min.).mp442.51 MB
 2 - 4 - 8. Closure properties of regular languages (20 min.).mp422.96 MB
 2 - 2 - 6. Regular expressions in the real world (17 min.).mp418.64 MB
 7_rs1.ppt287.5 KB
 7_rs1.pdf212.39 KB
 5_re1.pdf135.73 KB
 5_re1.ppt127.5 KB
 8_rs2.ppt125.5 KB
 8_rs2.pdf99.33 KB
 3 - 3 - 11. Normal forms for context-free grammars (27 min.).mp431.09 MB
 3 - 1 - 9. Introduction to context-free grammars (27 min.).mp430.46 MB
 3 - 2 - 10. Parse trees (26 min.).mp429.64 MB
 3 - 4 - 12. Pushdown automata (24 min.).mp426.69 MB
 9_cfl1.ppt167 KB
 12_pda1.ppt147 KB
 10_cfl2.pdf138.44 KB
 11_cfl3.ppt136 KB
 10_cfl2.ppt134.5 KB
 11_cfl3.pdf122.71 KB
 4 - 3 - 15. Decision and closure properties for CFL's (35 min.).mp439.58 MB
 4 - 4 - 16. Turing machines (34 min.).mp438.22 MB
 4 - 1 - 13. Equivalence of PDA's and CFG's (18 min.).mp420.55 MB
 4 - 2 - 14. The pumping lemma for CFL's (12 min.).mp413.46 MB
 16_tm1.ppt203 KB
 16_tm1.pdf152.12 KB
 15_cfl5.ppt147 KB
 15_cfl5.pdf130.34 KB
 13_pda2.ppt113 KB
 14_cfl4.pdf92.77 KB
 5 - 3 - 19. Specific undecidable problems (56 min.).mp462.4 MB
 5 - 1 - 17. Extensions and properties of Turing machines (37 min.).mp441.5 MB
 5 - 2 - 18. Decidability (18 min.).mp420.78 MB
 19_tm4.ppt229 KB
 17_tm2.ppt201 KB
 19_tm4.pdf190.22 KB
 17_tm2.pdf177.11 KB
 18_tm3.ppt103.5 KB
 18_tm3.pdf91.82 KB
 5 - 3 - 19. Specific undecidable problems (56 min.).srt66.57 KB
 6 - 2 - 21. Satisfiability and Cook's theorem (44 min.).mp449.36 MB
 6 - 3 - 22. Specific NP-complete problems (33 min.).mp436.64 MB
 6 - 1 - 20. P and NP (25 min.).mp428.49 MB
 21_pnp2.ppt172.5 KB
 22_pnp3.ppt164 KB
 22_pnp3.pdf135.17 KB
 21_pnp2.pdf134.54 KB
 20_pnp1.ppt119 KB
 20_pnp1.pdf101.08 KB
 6 - 2 - 21. Satisfiability and Cook's theorem (44 min.).srt52.56 KB
 7 - 3 - Problem Session 3.mp427.2 MB
 7 - 1 - Problem Session 1.mp418.74 MB
 7 - 4 - Problem Session 4.mp411.57 MB
 7 - 2 - Problem Session 2.mp411.45 MB
 problem-session-2.ppt275 KB
 problem-session-2.pdf143.93 KB
 problem-session-3.pdf137.74 KB
 problem-session-3.ppt121.5 KB
 problem-session-4.ppt95 KB
 problem-session-1.ppt79 KB
 problem-session-1.pdf72.7 KB
 problem-session-4.pdf22.43 KB
 7 - 1 - Problem Session 1.srt16.54 KB
 7 - 1 - Problem Session 1.txt11.34 KB

Description

I want to welcome everyone to the free on-line automata course I have developed. First, I want to acknowledge the help of Zhu ChenGuang, without whose help I never would have been able to put these materials together. ChenGuang will be joining me as a "teaching assistant" for this course and will help in monitoring the class discussions. Both he and I will contribute comments when we think it is appropriate, but most of the time, students will resolve their own discussions.

Sharing Widget


Download torrent
798.65 MB
seeders:8
leechers:0
Coursera / Stanford University - Automata : Theory of automata and grammars

All Comments

0xmovva
Content is great and the speed is satisfactory!! Thank You although the uploader does not exist at this time
suk111
Thanks