| |
Apr 18, 2024
|
|
|
|
|
EECS 271: Theory of Computation
[4 units]
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.
Prerequisite: Senior level math knowledge and the fundamentals of computer algorithms required. Normal Letter Grade only. Laboratory included.
View course scheduling information
Add to My Catalog (opens a new window)
|
|
