CIS 473 - Automata and Computability

College of Engineering and Computer Science
3 credit(s) At least 1x fall or spring

Countable and uncountable sets; diagonalization proofs; finite state automata; regular, context-free, context-sensitive, recursive, and r. e. languages; Turing machines; relationships between classes of languages and machines; the halting problem; proof methods for decidability and undecidabilty.
PREREQ CIS 375 OR MAT 375
Shared Competencies Information Literacy and Technological Agility; Critical and Creative Thinking