2011-2012 University Catalog 
  
2011-2012 University Catalog

CS 600 - Theory of Computation

Credits: 3 (NR)
Introduction to logic and proof techniques, formal languages, automata theory, and computational complexity. Specific topics include regular and context-free languages, Turing machines, NP-completeness, and undecidability.

Prerequisite(s): CS 583 and discrete mathematics.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0