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.
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE B1
(80696) |
90 |
2026-01-05 - 2026-04-10 (TR)
09:30 - 10:50
|
|