CSI 435 - Formal Languages And Automata

Institution:

McKendree University

Subject:

Description:

This course examines the fundamental limitations and properties of computation. Students will explore various models of computation including regular expressions, finite state machines, context-free grammars, push-down automata and Turing machines. Classes of languages including regular languages, context-free languages, recursive languages and RE languages will also be explored. Same as MTH 435. Prerequisite: CSI 330, MTH 375, ENG 360. As needed.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.mckendree.edu/prospective/admissions/index.aspx

Phone Number:

(618) 537-4481

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.