regular languages, finite automata, nondeterminism, Kleene's Theorem, mimimal finite automata, nonregular languages, context-free languages, derivation trees and ambiguity, simplified forms and normal forms, pushdown automata, the equivalence of CFG's and PDA's, CFL's and non-CFL's, Turing machines.
Special needs. If you are entitled to extra accommodation for any reason (such as a disability), we will make every reasonable attempt to accomodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.
You can find the class news and announcements in the following link. News and Announcements here.