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.

Winter Term 2019

Lecture Sections

Winter Term 2019 - LEC B1 (96373)

TR 09:30:00 - 10:50:00 (TBD)
Instructor: jhoover@ualberta.ca - Profile

View Previous Terms