CS 475
Fall 2006 All Classes
All Classes
Credit: 3 OR 4 hours.
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity.
Same as MATH 475. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 273 or consent of instructor.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
35887
|
Lecture-Discussion
|
C3
|
11:00AM
-12:15PM
|
TR
|
1310 Digital Computer Laboratory
|
Viswanathan, M
|
|
|
|
35895
|
Lecture-Discussion
|
C4
|
11:00AM
-12:15PM
|
TR
|
1310 Digital Computer Laboratory
|
Viswanathan, M
|
|