CS 273
Summer 2008 All Classes
All Classes
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:
Quantitative Reasoning II
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
34250
|
Discussion/
Recitation |
AD1
|
9:00AM
-10:15AM
|
F
|
1109 Siebel Center for Comp Sci
|
Milans, K
|
|
|
|
30778
|
Lecture
|
AL1
|
9:00AM
-10:15AM
|
MTWR
|
1109 Siebel Center for Comp Sci
|
Milans, K
|
|