CS 373
Spring 2009 Part of Term 1
Jan 20-May 6
Credit: 3 hours.
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; computability and the halting problem; undecidable problems.
Prerequisite: CS 173 or MATH 213; CS 225.
Students must register for one lecture and one discussion section.
This course satisfies the General Education Criteria in
Fall 2022 for:
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
50145
|
Discussion/
Recitation |
AD1
|
2:00PM
-2:50PM
|
T
|
1111 Siebel Center for Comp Sci
|
Har-Peled, S
Hodosh, M Parthasarathy, M |
|
|
|
50146
|
Discussion/
Recitation |
AD2
|
3:00PM
-3:50PM
|
T
|
1111 Siebel Center for Comp Sci
|
Har-Peled, S
Hodosh, M Parthasarathy, M |
|
|
|
50147
|
Discussion/
Recitation |
AD3
|
4:00PM
-4:50PM
|
T
|
1111 Siebel Center for Comp Sci
|
Har-Peled, S
Parthasarathy, M Sundar, A |
|
|
|
50148
|
Discussion/
Recitation |
AD4
|
4:00PM
-4:50PM
|
W
|
1111 Siebel Center for Comp Sci
|
Har-Peled, S
Zamani Nasab, R Parthasarathy, M |
|
|
|
50142
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
TR
|
1105 Siebel Center for Comp Sci
|
Har-Peled, S
Parthasarathy, M |
|
|
|
50143
|
Lecture
|
AL2
|
12:30PM
-1:45PM
|
TR
|
1105 Siebel Center for Comp Sci
|
Har-Peled, S
Parthasarathy, M |
|