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.
||Gen Ed Area Dept:
|Course Format: Lecture||Grading Mode: Graded|
||Fulfills a Major Requirement for: (COMP)(IDEA-EE)(INFO-MN)(MATH)(NS&B)(SISP)
||Past Enrollment Probability: Not Available
|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|