Skip to main content

LAKERS TOGETHER: Find out how we're moving forward. Learn about campus safety measures including testing, face coverings and vaccines.

2020-2021 Undergraduate & Graduate Catalog

Search Help

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. Cross-listed with CIS 465. Prerequisites: CIS 162 and either MTH 315 or MTH 325.

Credits: 3



If you are in need of assistance please submit any questions or comments.