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 |
| 35895 | lecture- discussion | G4 | 09:30 AM - 10:45 AM | TR | room 1404
Siebel Center for Comp Sci | Pitt, L |
4 hours
|
| 41803 | online | ONL | ARRANGED | | | Pitt, L |
Academic Outreach restrictions and assessments apply, see http://www.outreach.uiuc.edu; Please see http://online.engr.uiuc.edu/descriptions/fall2004.htm for more details on this course.
Online
AO Tuition 608, AO Tuition 608, AO Fees 36, and AO Fees 36.00 dollars.
|
| 35887 | lecture- discussion | UG3 | 09:30 AM - 10:45 AM | TR | room 1404
Siebel Center for Comp Sci | Pitt, L |
3 hours
|
| |
