http://www.cs.dartmouth.edu/courseguide/undergrad/cs_49.html
Theory of Computation
(Computer Science 49)
Times: 96F: 2 97W: 11 97F: Arrange
Instructors: Young (fall), Aslam (winter)
Prerequisite: Computer Science 25 (students who
have not taken Computer Science 25, but have a strong
mathematical background, may take Computer Science 49
with permission of the instructor).
Dist: QDS
This course serves as an introduction to formal models of languages and
computation. Topics covered
include finite automata, regular languages, context-free languages, pushdown
automata, Turing machines,
computability, and NP-completeness.