Submitted by Anonymous (not verified) on Mon, 10/31/2016 - 10:43am
CSCI - 660 - 01
The goal of the course is to provide graduate students who have taken CSCI 661 (Foundations of Computer Science Theory) during the immediately preceding fall semester and obtained a grade of "B-", "C+" or "C" the opportunity to fill in the gaps in their knowledge so that they may successfully carry on with graduate courses in the spring semester. As such, the course will give students additional experience in topics which include but are not limited to: discrete mathematics, DFAs and NFAs, regular expressions and Kleene's Theorem, Pumping Lemma for regular languages, CFLs and PDAs, Turing machines, decidability, and complexity, with a focus on the specific topics that have been most challenging to the particular students enrolled. The course will meet 8 hours per week, in two-hour sessions, four days per week.