CSC 361 - FINITE AUTO & FORMAL LANG

Institution:

Kutztown University of Pennsylvania

Subject:

Computer Science

Description:

An introduction to finite state automata and regular expressions; the Myhill Nerode theorem and the minimization of finite automata; context free grammars, the Chomsky normal form; the Greibach normal form, and push-down automata; properties of context free languages; Turing machines; computability and the halting problem, the Chomsky hierarchy; deterministic context free languages and LR(k) grammars.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.kutztown.edu/

Phone Number:

(610) 683-4000

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.