Credit: 3 hours.

This course satisfies the General Education Criteria for a
Quant Reasoning II course.

Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; computability and the halting problem; undecidable problems. Prerequisite: CS 125 or ECE 190; CS 173 or MATH 213.

Section Information
CRN	Type	Section	Time	Days	Location	Instructor
31259	lecture- discussion	P	11:00 AM - 12:15 PM	TR	room 1320 Digital Computer Laboratory	Fleck, M; Chekuri, C
Quant Reasoning II course.

View schedules for

CS 273Intro to Theory of Computation

CS 273
Intro to Theory of Computation