Apr 20, 2024  
2013-2014 HillBook (Class of 2017) 
    
2013-2014 HillBook (Class of 2017) [ARCHIVED HILL BOOK]

CSC 384 - Theory of Computation

Three Credits
Alternate Years: Fall 2014, 2016

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. Also listed as MTH 384 .

Prerequisite(s): CSC 201 .