1. Review for final 12-17-14 1-3pm

2. 2 Review for Midterm 10-9-14 Induction – On integer: HW1, Ex 2.2.9b p54 – On length of string: Ex 2.2.2 p53, HW2, HW3 Covered on midterm (2.2.9a) but could be on final Testing string acceptance – DFA: FA2 #23 – NFA: FA3 #9 covered on midterm –  -NFA: FA3 #42

3. 3 More Review for Midterm Equivalence – NFA to DFA Full SC: FA3 #16-18 Lazy SC: FA3 #19-21 covered on midterm –  -NFA to NFA: FA3 #46 covered on midterm –  -NFA to DFA: FA3 # 49-53

4. 4 Review for final Testing algebraic laws for RE – 3.4.1 p121-122, 3.4.2 p122 Find the RE for a given type of strings – Ex 3.1.1 and 3.1.2 p 91 Describe the strings generate by a given RE – Ed 3.1.4 p92

5. 5 DFA to RE – K-paths: Ex 3.2.1 p107 (HW6) – Elimination of states: Example 3.6 text p101 RE to  -NFA: – Ex 3.2.4 p108 (HW6) – Quiz 5 problem 1 More Review for final

6. 6 Decision properties of regular languages – Regular languages 1: slides 5-32 – Text pp150-166 – Construction of minimum-state DFA HW8, ex 4.4.1 p165 Closure properties of regular languages Quiz 7 – Homomorphism and Inverse homomorphism: HW9 – Construction of product DFAs: RL2 slides 5-6 – Construction of inverse homomorphism DFA Regular languages 2: slide 21 More Review for final

7. 7 Pumping Lemma (RL1 #12) – Quiz #6 question 1 – Test if L is regular: HW7, 4.1.2 p132 Context-free grammars 1&2: – Design a CFG Ex 5.1.1 p181 – LM/RM derivations, Parse Trees: HW10, Ex 5.1.2 p182, quiz 8 – Ambiguous CFG: HW10, quiz 8 – LL1 CFG: quiz 8

8. 8 More Review for final Context free grammars 3 – Clean up and CNF HW11 and quiz 10 Pushdown automata 1 – Ex 6.1.1 p233 – Ex 6.2.1 p241 – HW12, Ex 6.2.5 p242 Pushdown automata 2 – Ex 6.3.1 p251