COMPSCI 2AC3 — Automata and Computability
Finite state machines, regular languages, regular expressions, applications of regular languages, grammars, context-free languages, models of computation, computability and decidability.
Terms offered: Winter
Antirequisites: COMPSCI 2FA3, COMPSCI 2MJ3, SFWRENG 2FA3