Sketch Notes by Students

Students taking this course for honors credit produced the following graphical notes for some sections of the book that we covered in class and some sections that we did not cover.

1. Section 2.1, Context Free Grammars by Kyle Reing
2. Section 2.2, Pushdown Automata by Astha Patni
3. Section 3.1, Turing Machines by Matt Bruhin
4. Section 6.4, A Definition of Information by Kyle Reing
5. Section 7.4, NP-Completeness by Andrew Lawson
6. Section 8.2, The Class PSPACE by Astha Patni
7. Section 10.3, Alternation by Matt Bruhin
8. Section 10.6, Cryptography by Andrew Lawson