[Calendar Home Page] Wilfrid Laurier University - 2004-2005 Undergraduate Academic Calendar

Course Description

CP414 Foundations of Computing 0.5

Deterministic and nondeterministic finite automata (DFAs and NFAs), regular expressions, context-free grammars, relationship of push-down automata and context-free grammars, definition of the classes P and NP, NP-completeness (Cook's theorem), standard NP-complete problems, reduction techniques, Turing machines. The halting problem.

Prerequisite: CP312, MA238.

[Table of Contents] [Index] [Glossary]
[Courses by Subject] [Courses by Name] [Calendar Search]

Official electronic version updated at 10:33 a.m. March 31, 2005

LAURIER Home COMMENTS M Watson, Editor Course Timetable Class Timetable Registrar's Site]