COMP 301
Spring 2017
| Section:
01
|
| Crosslisting:
COMP 500 |
This course is an introduction to formalisms studied in computer science and mathematical models of computing machines. The language formalisms discussed will include regular, context-free, recursive, and recursively enumerable languages. The machine models discussed include finite-state automata, pushdown automata, and Turing machines. |
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: COMP211 AND COMP212 AND MATH228 |
|
Fulfills a Requirement for: (COMP)(IDEA-MN)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(STS) |
|
Past Enrollment Probability: 75% - 89% |
|
|