CS 475

Spring 2009 Part of Term 1

Part of Term 1
Jan 20-May 6

Formal Models of Computation

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 373.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 475 class schedule data for spring 2009
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	51363	Lecture-Discussion	C3	11:00AM -12:15PM	TR	136 Burrill Hall	Lavalle, S	Part of Term: 1 Date Range: 01/20/09-05/06/09 Credit: 3 hours
	51364	Lecture-Discussion	C4	11:00AM -12:15PM	TR	136 Burrill Hall	Lavalle, S	Part of Term: 1 Date Range: 01/20/09-05/06/09 Credit: 4 hours Restriction(s): Restricted to Graduate - Urbana-Champaign.