2014-2015 Undergraduate & Graduate Catalog
CIS 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 problem, time complexity of algorithms, and NP-complete problems. (3-0-0) Crosslisted with MTH 465. Offered fall semester of odd-numbered years. Prerequisites: MTH 325, CIS 162 and admitted to CIS major.
Credits: 3