Apr 25, 2024  
2015-2016 HillBook (Class of 2019) 
    
2015-2016 HillBook (Class of 2019) [ARCHIVED HILL BOOK]

CSC 384 - Theory of Computation

Three Credits
Alternate Years: Fall 2016, 2018

Introduction to the general theory of computation. Formal grammars: regular, context-free, and context-sensitive languages. Formal automata: finite-state and pushdown models. Decidability. Turing Machines. The Chomsky hierarchy. NP-Completeness and Complexity Theory.

Prerequisite(s): CSC 201 .
Cross-listed with MTH 384 .