Computer Science Program
Course Description

CS 228
Theory of Computation
Spring

An introduction to the mathematical basis for the study of computability and to the formal theory behind compiler design. Topics include the formal models of computation such as finite state automata, pushdown automata, and Turing machines; languages and grammars, such as regular languages and grammars, context-free languages and grammars, and recursively enumerable languages and grammars; and the problems that a machine can and cannot solve.
Offered every other year beginning 2019-20.

Course Credit:
4

Instructor(s):
Steven Givant, Susan Wang

Prerequisite:
MATH 006 or MATH 048

Note(s):
Concurrent workshop required. Prerequisite of MATH 006 or MATH 048 may be waived by the instructor.
Open to graduate students only.

  ICS Program Brochure

About the Program

Requirements

ยป Course List

Course Schedule

Graduate Catalog

Academic Calendar

Library

ICS Thesis Guidelines

Summer Internships

Talks and Workshops

Tours

Contact Information
P: 510.430.3309
E: grad-admission@mills.edu

If you have a specific question for a faculty member, please contact ics@mills.edu or call 510.430.2226.


Last Updated: 8/25/17