Previous Term
No future terms
Winter Term 2027 (1980)
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 102, 125, 126, or 127.
LECTURE B1 (75608)
2027-01-04 - 2027-04-09
TR 09:30 - 10:50