Stanford Automata Theory

Stanford Automata Theory
English | MP4, PDF | Size: 391.69 MB

The course will have a number of homeworks that are designed using the Gradiance technology. The objective of these homeworks is to enable everyone to get 100% and learn the underlying material. While questions look like multiple choice, you should think of them as more conventional "solve this problem and submit the solution" questions. That is, you are given a problem to solve, which you should work completely. Then, you are given a random choice of responses that are designed to figure out whether you got the right solution or not. If you do have the right solution, you should be able to answer the question easily, regardless of the choices presented. If you get it wrong, you will be given a hint and allowed to try again. Your score on a homework is the maximum of any try. We group about 5 questions together, so you can't repeatedly guess each question independently, without actually doing the work. Each week you will have about 2 hours of video to watch, and either one or two groups of homework questions. The time taken by the videos is about half the time I took to deliver the same material in class. The reason the video goes faster than in-class presentation is that a lot of the "ums" and fumbling are edited out. The speed can be good, if the material is not dense or hard to follow. However, there will undoubtedly be points where the going is rough -- details of a proof or an algorithm. In those cases, I encourage you to take advantage of the fact that the lectures are on video, to repeat material, or pause it to stare at a slide for example. In the first week's videos, you will begin with an introduction to the whole course. I want to try to convince you of the value of learning the four big concepts that you can take away from this course: finite automata, context-free grammars, undecidable problems, and intractable problems (NP-completeness). The second video is an informal introduction to finite automata. Both these two first videos are "light," and I expect you to have little trouble. The third video introduces deterministic finite automata, and at this point we start to get more formal. In the fourth video, the important concept of nondeterminism is introduced. We learn the remarkable fact that despite the almost "magic" capability of nondeterminism, it does not add power to the finite automaton (although it does make description of many applications of automata a lot easier).

Week 1- Finite Automata/1 - 1 - 1. Course outline and motivation (15 min.).mp4 17.08MB
Week 1- Finite Automata/1 - 1 - 1. Course outline and motivation (15 min.).srt 64 bytes
Week 1- Finite Automata/1 - 1 - 1. Course outline and motivation (15 min.).txt 30 bytes
Week 1- Finite Automata/1 - 2 - 2. Informal introduction to finite automata (11 min.).mp4 12.58MB
Week 1- Finite Automata/1 - 2 - 2. Informal introduction to finite automata (11 min.).srt 15.70KB
Week 1- Finite Automata/1 - 2 - 2. Informal introduction to finite automata (11 min.).txt 10.76KB
Week 1- Finite Automata/1 - 3 - 3. Deterministic finite automata (36 min.).mp4 40.34MB
Week 1- Finite Automata/1 - 3 - 3. Deterministic finite automata (36 min.).srt 47.78KB
Week 1- Finite Automata/1 - 3 - 3. Deterministic finite automata (36 min.).txt 32.71KB
Week 1- Finite Automata/1 - 4 - 4. Nondeterministic finite automata (46 min.).mp4 51.54MB
Week 1- Finite Automata/1 - 4 - 4. Nondeterministic finite automata (46 min.).srt 46.01KB
Week 1- Finite Automata/1 - 4 - 4. Nondeterministic finite automata (46 min.).txt 31.50KB
Week 1- Finite Automata/1_intro.pdf 41.53KB
Week 1- Finite Automata/1_intro.ppt 72.50KB
Week 1- Finite Automata/2_vfa.ppt 296.00KB
Week 1- Finite Automata/2_vfa1.pdf 227.17KB
Week 1- Finite Automata/3_fa2.pdf 174.45KB
Week 1- Finite Automata/3_fa2.ppt 220.00KB
Week 1- Finite Automata/4_fa3.pdf 145.67KB
Week 1- Finite Automata/4_fa3.ppt 172.50KB
Week 2- Regular Expression and Properties of Regular Languages/2 - 1 - 5. Regular expressions (38 min.).mp4 42.51MB
Week 2- Regular Expression and Properties of Regular Languages/2 - 2 - 6. Regular expressions in the real world (19 min.).mp4 18.64MB
Week 2- Regular Expression and Properties of Regular Languages/2 - 3 - 7. Decision algorithms for regular languages (41 min.).mp4 46.73MB
Week 2- Regular Expression and Properties of Regular Languages/2 - 4 - 8. Closure properties of regular languages (20 min.).mp4 22.96MB
Week 3- Context-Free Grammars and Pushdown Automata/10_cfl2.pdf 138.44KB
Week 3- Context-Free Grammars and Pushdown Automata/10_cfl2.ppt 134.50KB
Week 3- Context-Free Grammars and Pushdown Automata/11_cfl3.pdf 122.71KB
Week 3- Context-Free Grammars and Pushdown Automata/11_cfl3.ppt 136.00KB
Week 3- Context-Free Grammars and Pushdown Automata/12_pda1.pdf 121.54KB
Week 3- Context-Free Grammars and Pushdown Automata/12_pda1.ppt 147.00KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 1 - 9. Introduction to context-free grammars (27 min.).mp4 30.46MB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 2 - 10. Parse trees (26 min.).mp4 29.64MB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 2 - 10. Parse trees (26 min.).srt 29.65KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 2 - 10. Parse trees (26 min.).txt 20.30KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 3 - 11. Normal forms for context-free grammars (27 min.).mp4 31.09MB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 3 - 11. Normal forms for context-free grammars (27 min.).srt 33.86KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 3 - 11. Normal forms for context-free grammars (27 min.).txt 23.13KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 4 - 12. Pushdown automata (24 min.).mp4 26.69MB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 4 - 12. Pushdown automata (24 min.).srt 26.41KB
Week 3- Context-Free Grammars and Pushdown Automata/3 - 4 - 12. Pushdown automata (24 min.).txt 18.09KB
Week 3- Context-Free Grammars and Pushdown Automata/9_cfl1.pdf 96.67KB
Week 3- Context-Free Grammars and Pushdown Automata/9_cfl1.ppt 167.00KB

 http://www.netload.in/dateiYOuwVCouug/sat.rar.htm