| |
Apr 25, 2024
|
|
|
|
|
EECS 271: Theory of Computation
[4.0 units]
Introduces the main computational model 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. Senior level math knowledge and the fundamentals of computer algorithms are necessary for successful completion of this course.
Normal Letter Grade only. Laboratory included.
View course scheduling information
Add to My Catalog (opens a new window)
|
|
