Course Description

27-460 Elements of Theory of Computation F(3-0) [0.50]

An introduction to finite automata, formal languages and sequential machines. Models of computation, including Turing machines and the hierarchy of machines/languages. Decidability and computability.

Prerequisites: 27-349, 27-360.

Course Profile

1998-99 Undergraduate Calendar