COMP 301
Fall 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 |
| SECTION 01 |
| Instructor(s): Lipton,James Times: ..T.R.. 08:50AM-10:10AM; Location: SCIE139; |
| Total Enrollment Limit: 20 | | SR major: 12 | JR major: 8 | | |
| | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 0 | FR: 0 |
| SECTION 02 |
| Instructor(s): Lipton,James Times: ..T.R.. 10:20AM-11:40AM; Location: SCIE139; |
| Total Enrollment Limit: 20 | | SR major: 12 | JR major: 8 | | |
| | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 0 | FR: 0 |
|