/Home/Academic Programs/Course Descriptions/CS 436/

Theory of Computation

Course: CS 436

Description: A study of formal models of computation, such as finite state automata, pushdown automata, and Türing machines. Elements of formal languages to be examined include regular expressions, context-free languages, recursively-enumerable languages, undecidability, and NP-completeness.

Units: 3

Recommended prerequisite: MATH 253 and CS 335 or consent of instructor.

Format: Two hours lecture, two hours lab per week.

Home Academic Programs Faculty & Staff Facilities Internships Exchange Programs Computing Science Club Alumni Contact Us


Academic Programs | Faculty & Staff | Facilities | Internships
Exchange Programs | Computing Science Club | Alumni | Contact Us


Department of Computing Science | Humboldt State University | 1 Harpst St. | Arcata, CA 95521
Nelson Hall West 234 | Telephone: (707) 826-3834 | Fax: (707) 826-3833 | Email: csdept@humboldt.edu