CS 475

Fall 2004 Part of Term 1

Part of Term 1
Aug 25-Dec 10

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.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 475 class schedule data for fall 2004
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	35895	Lecture-Discussion	G4	9:30AM -10:45AM	TR	Siebel Center for Comp Sci	Pitt, L	Part of Term: 1 Date Range: 08/25/04-12/10/04 Credit: 4 hours Restriction(s): Restricted to Graduate - Urbana-Champaign.
	35887	Lecture-Discussion	UG3	9:30AM -10:45AM	TR	Siebel Center for Comp Sci	Pitt, L	Part of Term: 1 Date Range: 08/25/04-12/10/04 Credit: 3 hours