CS 273
Spring 2008 Part of Term 1
Jan 14-Apr 30
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 | |
|---|---|---|---|---|---|---|---|---|
|
48105
|
Discussion/
Recitation |
AD1
|
9:00AM
-9:50AM
|
W
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|
|
|
48101
|
Discussion/
Recitation |
AD2
|
10:00AM
-10:50AM
|
W
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|
|
|
48107
|
Discussion/
Recitation |
AD3
|
12:00PM
-12:50PM
|
W
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|
|
|
48102
|
Discussion/
Recitation |
AD4
|
1:00PM
-1:50PM
|
W
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|
|
|
48111
|
Discussion/
Recitation |
AD5
|
3:00PM
-3:50PM
|
W
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|
|
|
31259
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
TR
|
Ceramics Building
|
Har-Peled, S
Fleck, M |
|
|
|
48581
|
Lecture
|
AL2
|
3:30PM
-4:45PM
|
TR
|
Siebel Center for Comp Sci
|
Har-Peled, S
Fleck, M |
|