|
|  |  |
View schedules for
|
|
|
 |
CS 475
Formal Models of Computation
Credit: 3 or 4 hours.
(C S 375) 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 Information
| CRN | Type | Section | Time | Days | Location | Instructor |
| 35887 | lecture- discussion | C3 | 09:30 AM - 10:45 AM | TR | room 1320
Digital Computer Laboratory | Viswanathan, M |
3 hours
|
| 35895 | lecture- discussion | C4 | 09:30 AM - 10:45 AM | TR | room 1320
Digital Computer Laboratory | Viswanathan, M |
4 hours
|
| |
|
