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.
| Section | Capacity | Class times | Login to view Locations |
|---|---|---|---|
|
LECTURE B1
(75608) |
120 |
2027-01-04 - 2027-04-09 (TR)
09:30 - 10:50
|
|