Fall 2008 not offered
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|
||Prerequisites: COMP211 AND MATH228
||Fulfills a Major Requirement for: (COMP)(INFO-MN)(MATH)(NS&B)
To be announced.
|Examinations and Assignments: |
To be announced
|Drop/Add Enrollment Requests|
|Total Submitted Requests: 0||1st Ranked: 0||2nd Ranked: 0||3rd Ranked: 0||4th Ranked: 0||Unranked: 0|