|
|
|
Dec 02, 2024
|
|
2014-2015 Undergraduate Course Catalog [ARCHIVED CATALOG]
|
CIS 473 - Automata and Computability3 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 275 OR MAT 275
|
|
|