CSC 445 - Theory of Computation I

Institution:

California Polytechnic State University-San Luis Obispo

Subject:

Description:

Theory of formal languages and automata. Turing machines. Chomsky hierarchy. Theory of decidability and computability. 4 lectures. Prerequisite: CSC 141 and CSC/CPE 430.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.calpoly.edu

Phone Number:

(805) 756-1111

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Quarter

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.