CourseOverview:
CS 339, Computation Theory, is an introduction to the theoretical
structures
of programming languages and computers. Topics include regular
expressions,
formal grammars, abstract automata, and computability.
The class studies various formalisms introduced to model what
happens
when computing is done. The purpose is to find out what is true in a
purely
formal sense about computing.
Course Objectives:
Students completing CS 339 should understand the process of modeling at
a fundamental level. Students should also have a grasp of what is and
is
not computable.
Lynn Ziegler, lziegler@csbsju.edu