CMPUT 474: Formal Languages, Automata, and Computability¶

At a glance

Units: 3
Prerequisites: CMPUT 204 and one of MATH 102, 125, 126, or 127.
Offered: Scheduled: Winter 2027

Formal grammars; relationship between grammars and automata; regular expressions; finite state machines; pushdown automata; Turing machines; computability; the halting problem; time and space complexity.

Official catalogue entry · facts synced 2026-10-01

What Students Say¶

Nobody has reviewed this course yet. If you've taken it, add a review (no git needed).