CS 373
spring 2013
All Classes
Theory of Computation
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.
This course satisfies the General Education Criteria in Spring 2013 for:
- Quantitative Reasoning II
- Section Status Closed
- Section Status Open
- Section Status Pending
- Section Status Open (Restricted)
- Section Status Unknown
Section Status updates every 10 minutes.
| Detail | Status | CRN | Type | Section | Time | Day | Location | Instructor |
|---|