Sep 29, 2023  
2019-2020 Catalog 
2019-2020 Catalog [ARCHIVED CATALOG]

Add to My Catalog (opens a new window)

EECS 271: Theory of Computation

Units: 4

Introduces the main computational models defining the theory of computation and illustrates fundamental theorems defining the limits of what can be computed. Topics include: finite and pushdown automata; nondeterministic models; regular languages and context-free grammars; Turing machines; and decidability problems.

Course Details
Repeatable for Credit: No
Laboratory included
Normal Letter Grade only

Requisites and Restrictions
Instructor Permission Required: No
Senior level math knowledge and the fundamentals of computer algorithms required

View course scheduling information

Add to My Catalog (opens a new window)