2012-2013 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, non-determinism, pushdown automata, context-free languages, Turing machines and variants, halting problem, time complexity of algorithms, and NP-complete problems. (3-0-0) Offered fall semester of odd-numbered years.