Lecture 16

We started the material in chapter 13 (trees). In particular, we saw two tree induction proofs involving

• llama trees, in which the labels on interior nodes are the product of the labels on their children and the roots are always divisible by 5
• a grammar whose tree nodes have the same number of a labels as b and c labels

Announcements

• The second midterm is Tuesday the 29th (in class). If you need to book a room at DRES, speak to them soon.
• Pre-exam office hours will be posted on piazza later this week.
• Some exam review materials are posted. Others should be coming soon.