Theory Of Computation - By Shai Simonson (Size: 3.38 GB)
| | | Exam_01_Solutions.pdf | 428.15 KB |
| | | quiz_01.pdf | 290.09 KB |
| | | Exam_01.pdf | 7.54 KB |
| | | Exam_02B.pdf | 6.89 KB |
| | | Exam_02.pdf | 5.07 KB |
| | | Recitation 2 Notes.pdf | 417.36 KB |
| | | Recitation 1 Notes.pdf | 355.94 KB |
| | | Recitation 9 Notes.pdf | 345.58 KB |
| | | Recitation 5 Notes.pdf | 302.78 KB |
| | | Recitation 4 Notes.pdf | 299.33 KB |
| | | Recitation 6 Notes.pdf | 226.71 KB |
| | | Recitation 3 Notes.pdf | 194.2 KB |
| | | Recitation 7 Notes.pdf | 154.24 KB |
| | | Recitation_03_6.pdf | 25 KB |
| | | Recitation_04_2.pdf | 24.75 KB |
| | | Lecture_Notes.doc | 54 KB |
| | | Lecture_Notes.pdf | 51 KB |
| | | Problem_Set_01_Solutions.pdf | 1.55 MB |
| | | Problem_Set_04_Solutions.pdf | 1.39 MB |
| | | Problem_Set_05_Solutions.pdf | 1.16 MB |
| | | Problem_Set_02_Solutions.pdf | 1.02 MB |
| | | Problem_Set_03_Solutions.pdf | 606.07 KB |
| | | Problem_Set_03_Solutions_Errata.pdf | 49.03 KB |
| | | Problem Set 01.pdf | 662.22 KB |
| | | Problem Set 02.pdf | 445.98 KB |
| | | Problem_Set_03.pdf | 12.04 KB |
| | | Problem_Set_05.pdf | 9.16 KB |
| | | Problem_Set_04.pdf | 8.14 KB |
| | | 15.The Bullseye - Lecture 15.rm | 209.42 MB |
| | | 9.Pushdown Machiness - Lecture 9.rm | 193.19 MB |
| | | 20.Complexity Theory, Quantified Boolean Formula - Lecture 20.rm | 184.26 MB |
| | | 16.Turing Machines - Lecture 16.rm | 180.73 MB |
| | | 2.Closure and Nondeterminism - Lecture 2.rm | 179.14 MB |
| | | 4.Minimizing FSMs - Lecture 4.rm | 178.23 MB |
| | | 3.The Pumping Lemma - Lecture 3.rm | 177.44 MB |
| | | 1.Finite State Machines - Lecture 1.rm | 176.14 MB |
| | | 22.DecidabilityComplexity Relationship, Recursion Theorem - Lecture 22.rm | 176.1 MB |
| | | 11.CFGs and NPDMs - Lecture 11.rm | 176 MB |
| | | Contents - Theory Of Computation.png | 327.04 KB |
| | | About Course.png | 171.45 KB |
| | | syllabus.pdf | 8.25 KB |
Description
Theory of Computation
Instructor: Shai Simonson
Course Description
A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.
Text: Introduction to the Theory of Computation, Michael Sipser.
Reference: Introduction to Automata Theory, Languages and Computation, Hopcroft, Motwani and Ullman.
Requirements: Two exams, five problem sets.
Sharing Widget