CMPUT 474 - Formal Languages, Automata, and Computability

3 units (fi 6)(EITHER, 3-0-0)

Formal grammars; relationship between grammars and automata; regular expressions; finite state machines; pushdown automata; Turing machines; computability; the halting problem; time and space complexity. Prerequisites: CMPUT 204 and one of MATH 225, 227, or 228.