CSC 341 - Theory of Computation

Institution:

DePauw University

Subject:

Description:

Group 1, 1 course Various models of formal languages (which provide a basis for compilers) and computation (which defines the kinds of problems that can be solved by a computer) are studied. Topics include regular languages, regular expressions, finite state automata, context-free languages, context-free grammars, push-down automata and Turing machines. The application of these models to several practical problems in computer science is considered. Computational limits are also discussed, using as examples several problems which cannot be solved by any algorithm. Prerequisite: CSC 122 and MATH 223 . Typically offered annually. Not offered pass/fail.

Credits:

1.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.depauw.edu

Phone Number:

(765) 658-4800

Regional Accreditation:

North Central Association of Colleges and Schools

Calendar System:

Four-one-four plan

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.