CS 351 - Automata Theory

Institution:

Seton Hill University

Subject:

Computer Science

Description:

Topics include: regular grammers, finite automata, context-free grammers, push-down automata, and Turing machines. Introductory treatment of computable and non-computable functions. Halting problems will also be covered. Prerequisite: CS220 or CS290. Spring semester, even-numbered years. 3 credits. Fee.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.setonhill.edu

Phone Number:

(724) 834-2200

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.