CMPUT 474 - Formal Languages, Automata, and Computability

★ 3 (fi 6)(EITHER, 3-0-0)

Faculty of Science

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.

No syllabi

Winter Term 2025

Lectures

Section Capacity Class times
LECTURE B1
(70811)
70
2025-01-06 - 2025-04-09 (TR)
09:30 - 10:50