CS 435 - Theory of Computation

(3 S.H.)

This course explores the theoretical foundations of computer science. Topics include finite state automata and regular languages, context-free grammars, pushdown automata and context-free languages. Turing Machines and recursively enumerable sets, computability and the halting problems, Chomsky hierarchy and undecidable problems. Prerequisites: ◆ CS 341 - Data Structures and junior or senior standing. Grade only. Offered annually.

Course Registration