MTxPn = Midterm x Problem n. FEPn = Final Exam Problem n. There are two sections of this class. Midterm and final info is for the first sections test, but the second section covered comparable outcomes. Within the class there were two versions of a given test; however, these two versions were just problem permutations of each other. The results above are all for the first of these two permutations. The two classes each had different tests which were variants of each other, testing the same learning outcomes.

LO1 (Learning Outcome 1) -- Write a grammar for a language described otherwise.

LO2 -- Construct deterministic and non-deterministic machines for various languages.

LO3 -- Describe a language in terms of a regular expression.

LO4 -- Find a regular expression for a language described by a finite automaton and conversely.

LO5 -- Construct a deterministic finite automaton from a non-deterministic one.

LO6 -- Minimize a deterministic automaton.

LO7 -- Be able to use a pumping lemma to show that some languages are not regular and/or not context-free. Use closure properties to simplify proofs of non-regularity of languages.

LO8 -- Be able to construct a pushdown automaton accepting a given language.

LO9 -- Construct a Turing machine accepting some simple languages.

LO10 -- State in precise mathematical terms what is meant by undecidability of the Halting Problem, and be able to show the undecidability of simple extensions of the Halting Problem, using the reduction technique.

N/A -- Important material covered in the course but not directly related to a specific learning outcome.