CS 350 - Theory of Computation

Institution:

Francis Marion University

Subject:

Computer Science

Description:

Introduction to the abstract concepts encountered in machine computation. Topics include finite automata, regular expressions, and formal languages, with emphasis on regular and context-free grammars. Questions related to decidability and undecidability are looked at by considering various models of computation including Turing machines, recursive functions, and universal machines.

Credits:

3.00

Credit Hours:

Prerequisites:

CS 318 AND MATH 230

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.fmarion.edu

Phone Number:

(843) 661-1362

Regional Accreditation:

Southern 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.