COMP 301
Spring 2014
| 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: Not Available |
| SECTION 01 |
Major Readings: Wesleyan RJ Julia Bookstore
To be announced
|
Examinations and Assignments:
To be announced |
Additional Requirements and/or Comments:
not known |
| Instructor(s): Lipton,James Times: ..T.R.. 09:00AM-10:20AM; Location: SCIE137; |
| Total Enrollment Limit: 20 | | SR major: 9 | JR major: 9 | | |
| Seats Available: -5 | GRAD: 0 | 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 |
|