CISC 3230 Theoretical Computer Science

3 hours; 3 credits

Overview 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: CISC 2210 and CISC 3130 and MATH 1201


The City University reserves the right, because of changing conditions, to make modifications of any nature in academic programs and requirements of the university and its constituent colleges without advanced notice. Students are advised to consult regularly with college and department counselors concerning their programs of study.

Access the college's current and recent course bulletins.