1. Reminder Test 3 is Friday after fall break.
2. Today's Material is NOT examinable.
3. Overview of Pumping Lemma: If L is regular/context-free language then every long string in L is "pumpable": has repeatable piece/pieces
4. Youtube videos on Pumping Lemma: Statement of the Pumping Lemma and Use of the Pumping Lemma
5. Youtube video on L-systems and Fractals: Making Mathematical Art with L-Systems and add one on Fractals