MATH334
Download as PDF
Theory of Computation
Course Description
This course covers fundamental ideas in the theory of computation, including formal languages, computability, complexity, and reducibility among computational problems. Topics include formal languages, finite state automata, Kleene's theorem, formal grammars, pushdown automata, context-free languages, Turing machines, computability, Church's Thesis, decidability, unsolvability, and NP- completeness. Prerequisites: CSCI 212 and Mathematics 230.
Units
0
Credit Hours Max
4
Repeatable
Yes