WCOMS3261-1: Computer Science Theory for Spring 2016

Days and Time

Tuesdays and Thursdays 11:40 AM-12:55 PM

Allowed For:

  • Undergraduate

Prerequisites:

COMS W3137 and W3203.

Notes:

None

Instructor:

Yannakakis, Mihalis

Description

Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness.