Computing Science 474

Computing Science 474 CMPT474
Formal Languages, Automata and Computability 3 (3-0-0-0)

Formal grammars; normal forms; relationship between grammars and automata; regular expressions; finite state machines, state minimization; pushdown automata; Turing machines; computability; complexity; introduction to recursive function theory.

Credit Restriction: Credit may be obtained for only one of Computing Science 474 or Mathematics 424

Prerequisites: Mathematics 200 [C- minimum grade required] and (Mathematics (12) or Computing Science (9) or Information Technology (9) ) and 2nd year standing required or special conditions as specified below
Further information: Course availability and times
Special Conditions: *9 additional credits of Mathematics to a total of 12 including MAT 200