CSIT 443 Theory of Computation

Regular expressions and finite automata; context-free grammars and pushdown automata; pumping arguments; closure properties; decision algorithm; Turing machines; computability and decidability; halting problem; and elementary complexity theory.

Credits

3

Prerequisite

CSIT 242 and CSIT 341

Offered

Every other year