MTH 465 - Automata and Theory of Computation

Institution:

Grand Valley State University

Subject:

Description:

Introduction to basic mathematical models of computation and the finite representation of infinite objects. Finite automata, regular languages, nondeterminism, pushdown automata, context-free languages, Turing machines and variants, halting problems, time complexity of algorithms, and NP-Complete problems. Cross-listed with CIS 465. Prerequisites: CIS 162 and either MTH 315 or MTH 325.

Credits:

3.00

Credit Hours:

Prerequisites:

Prerequisites: CIS 162 and either MTH 315 or MTH 325.

Corequisites:

Exclusions:

Level:

Instructional Type:

Other

Notes:

May have started spring/summer 2007 or earlier.

Additional Information:

Historical Version(s):

Institution Website:

www.gvsu.edu

Phone Number:

(616) 331-2020

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.