SCOMS3261-002: Computer Science Theory for Fall 2024

Days and Time

Tuesdays and Thursdays 10:10 AM-11:25 AM

Location

RTBA BTBA

Allowed For:

  • Undergraduate
  • Masters
  • Professional
  • PhD

Prerequisites:

None

Notes:

None

Instructor:

Malkin, Tal G

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.