 |
|
|
|
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
|
||
 |
 |
 |
|
 |
|
||
Course Description |
||
|---|---|---|
| Programs | Requirements | Courses | Forms | ||
| 440(G). THEORY OF COMPUTATION. (3, O, 3). | ||
| Abstract basis of machines and programming; automata, context free grammars, and Turing machines. Equivalence and non-equivalence of classes of devices. The Chomsky hierarchy. Incomputability. Computational complexity. Prereq: CMPS 341, 351 both with a minimum grade of C. |
|
|
|
|
 |
|
||
 |
 |
 |
|
 |
|
||