CSIS 402 - Introduction to Automata, Formal Languages, and Computability

Institution:

University of Nebraska at Kearney

Subject:

Description:

Prereq: CSIS 180* or MATH 115* A survey of the fundamental concepts and conclusions in the theory of computation. Topics cover regular languages and finite automata, Kleen's theorem, context-free languages and pushdown automata, formal grammars, Chomsky hierarchy, Turing machine and computability, computational complexity.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.unk.edu

Phone Number:

(308) 865-8441

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.