COMP 301
Spring 2026
| Section:
01
02
|
| 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: Student Option |
| Level: UGRD |
Prerequisites: COMP211 AND COMP212 AND MATH228 |
|
Fulfills a Requirement for: None |
|
Past Enrollment Probability: Less than 50% |
| SECTION 01 |
| Instructor(s): Lipton,James Times: ..T.R.. 08:50AM-10:10AM; Location: TBA |
| Total Enrollment Limit: 25 | | SR major: 13 | JR major: 10 | | |
| Seats Available: 25 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 2 | FR: 0 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
| SECTION 02 |
| Instructor(s): Lipton,James Times: ..T.R.. 10:20AM-11:40AM; Location: TBA |
| Total Enrollment Limit: 25 | | SR major: 13 | JR major: 10 | | |
| Seats Available: 25 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 2 | FR: 0 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|