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, one of CMPUT 229, E E 380 or ECE 212 and one of MATH 225, 227, or 228 or consent of the instructor.
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LECTURE B1
(10921) |
65 |
2024-01-08 - 2024-04-12 (TR)
09:30 - 10:50
ECHA 2-150
|
Primary Instructor: Dale Schuurmans
|