COMP 301
Fall 2007
| 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 include regular, context-free, context-sensitive, and recursively enumerable languages. The machines discussed include finite-state, pushdown and linear-bounded automata, and Turing machines. |
Essential Capabilities:
None |
Credit: 1 |
Gen Ed Area Dept:
None |
Course Format: Lecture | Grading Mode: Graded |
Level: UGRD |
Prerequisites: 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 |
Instructor(s): Aaron,Eric Times: ..T.R.. 02:40PM-04:00PM; Location: SCIE339; |
Total Enrollment Limit: 25 | | SR major: 0 | JR major: 0 |   |   |
Seats Available: 21 | GRAD: 0 | SR non-major: 10 | JR non-major: 10 | SO: 5 | FR: 0 |
Drop/Add Enrollment Requests | | | | | |
Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|