Study of automata, languages, and computability theory. Regular grammars, finite state automata, context-free grammars, pushdown automata, Turing machines, decidable and undecidable problems, and problem reduction. Fall, odd years. Prerequisite(s): CPSC 122 and (MATH 231 or MATH 301)
Prerequisite:
CPSC 223 Minimum Grade: D
and (MATH 231 Minimum Grade: D
or MATH 301 Minimum Grade: D)