Quick Course Search

CMPUT474 - Formal Languages, Automata, and Computability

Formal grammars; relationship between grammars and automata; regular expressions; finite state machines; pushdown automata; Turing machines; computability; the halting problem; time and space complexity. Prerequisite: CMPUT 204 or 275, one of CMPUT 229, E E 380 or ECE 212 and one of MATH 225, 227, or 228 or consent of the instructor.

There are currently no classes scheduled for current or future terms, or the classes that have been scheduled are canceled. To view previous terms, please click the View Previous Terms button below.


View Previous Terms