Automata Theory and Formal Languages
COMP 301
Spring 2022
| 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: |
| Level: UGRD |
Prerequisites: COMP211 AND COMP212 AND MATH228 |
|
Fulfills a Requirement for: None |
| SECTION 01 |
Major Readings: Wesleyan RJ Julia Bookstore
TBA
|
Examinations and Assignments:
TBA |
Additional Requirements and/or Comments:
|
| Instructor(s): Rose,Robert Times: ..T.R.. 08:50AM-10:10AM; Location: SCIE109; |
| Total Enrollment Limit: 35 | | SR major: 15 | JR major: 15 | | |
| | GRAD: X | SR non-major: X | JR non-major: X | SO: 5 | FR: X |
| SECTION 02 |
Major Readings: Wesleyan RJ Julia Bookstore
TBA |
Examinations and Assignments:
TBA |
Additional Requirements and/or Comments:
Compared to Section 01, this section will discuss fewer language formalisms and machine models in order to focus more on topics on computational complexity. |
| Instructor(s): Krizanc,Daniel Times: .M.W... 02:50PM-04:10PM; Location: SCIE141; |
| Total Enrollment Limit: 35 | | SR major: 15 | JR major: 15 | | |
| | GRAD: X | SR non-major: X | JR non-major: X | SO: 5 | FR: X |
|
|