| The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes.
Click the Schedule Type to find available offerings of the course on the Schedule of Classes.
|CS 4510 - Automata and Complexity|
Computational machine models and their language classes. Undecidability. Resource-bounded computations. Central complexity-theoretic concepts such as complexity classes, reducibility and completeness.
3.000 Credit hours
3.000 Lecture hours
Grade Basis: ALP
All Sections for this Course
Dept/Computer Science Department
Tech Elect CS, Engr, &Sciences, Theory (CS)