2016-2017 Undergraduate & Graduate Catalog
MTH 465 - Automata and Theory of Computation
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. Crosslisted with CIS 465. Offered fall semester of odd-numbered years. Prerequisites: CIS 162 and either MTH 315 or MTH 325.
Credits: 3