CSCI 410 - Automata & Formal Lang

Institution:

College of Charleston

Subject:

Computer Science

Description:

Topics to include finite automata and regular expressions, pushdown automata and context-free grammars, the Chomsky hierarchy, Turing machines, undecidability and computational complexity. Lectures three hours per week. NOTE: Please refer to the appropriate academic catalog for additional course information concerning prerequisites, co-requisites and course restrictions..

Credits:

3.00

Credit Hours:

Prerequisites:

MATH 307

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.cofc.edu

Phone Number:

(843) 953-5500

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

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.