C+IN SC 3211 - Automata, Computability, and Languages

Institution:

Temple University

Subject:

Description:

Finite automata, their limitations and capabilities, and Kleen’s theorem or regular expressions. Other types of automata and their events. Turing machine and computability, computable functions, and halting problems. Introduction to context-free languages. Syntactical analysis of such languages with application to translation.

Note: For Computer Science Majors.

Credits:

3.00

Credit Hours:

Prerequisites:

Grade of C or better in C+IN SC 1166 (0066) or MATH 2196 (W141), C+IN SC 2107 (0072), and C+IN SC 2168 (0068); Grade of C or better in MATH 1042 (0086)

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.TEMPLE.EDU

Phone Number:

(215) 204-7000

Regional Accreditation:

Middle States 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.