CISC. 3230

3 hours; 3 creditsOverview of theoretical computer science. Formal language theory, computability theory. Finite automata, context-free and regular grammars, push-down automata, and Turing machines. Other models of computation, including recursive functions. Universal program and unsolvability.Prerequisite: Computer and Information Science 2210 [11] and 3130 [22] and Mathematics 1201 [3.3].

014533