3 credit(s) This course is a continuation of the study of mathematical structures most frequently encountered in Computer Science. Topics covered include deterministic and non-deterministic finite automata, regular, context-free and other languages, push-down automata, grammars, Turing machines, computational complexity, and in particular the P vs. NP problem. Offered in Spring Semester.
Prerequisite(s):MATH 250 or CSIS 251. Equivalent: (Same as CSIS 351.) Attribute: (ATTR: ARTS, MHUL)