[aduni.org logo] [classroom photo]

Home
A History of ADU
Courses
   One Course
Faculty and Alumni
Colloquia

Course Directory
Math SICP Disc
HCW OOP Alg
Sys Web ToC
AI DB Prob

FAQ  ||  donate  ||  USB drive


 Theory of Computation

[spacer]
   previous | next
 

InstructorShai Simonson

Course Description | Lecture and Course Files | Student Evaluations

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.


[horizontal rule]

Site last updated: May 14, 2013
Comments? Questions?

Creative Commons License

[spacer]