CPTR 5250 - Autom Thry/Lang/Comp

Institution:

Chicago State University

Subject:

Description:

AUTOMATA THEORY, LANGUAGES, AND COMPUTATION (3) Formal languages, finite-state control machine, regular expressions and languages, Turing machines, push-down automata, context-free languages, feasible problems, p-complete theory; basic recursive functions theory, computational complexity theory, intractable problems. Additional course fee. Prerequisite: CPTR 3100/307, CPTR 4210/317. 3.000 Credit Hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture College of Arts and Sciences College Mathematics & Computer Science Department

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.csu.edu

Phone Number:

(773) 995-2000

Regional Accreditation:

North Central 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.