Courses:

Automata, Computability, and Complexity >> Content Detail



Recitations



Recitations

This section contains discussion materials and problems solved by students during the recitation sessions.


SES #Topics
R1Math Review (PDF)
R2DFAs and NFAs (PDF)
R3Regular Expressions and Non-Regular Languages (PDF)
R4Quiz Questions and Automata Wrap-up (PDF)
R5Turing Machines (PDF)
R6Undecidability (PDF)
R7Counter and Stack Machines, Reducibility, Rice's Theorem (PDF)
R8Quiz 2 Questions and Computability Wrap-up (PDF)
R9P and NP (PDF)
R10Poly-Time Reductions
R11NP-Completeness (PDF)
R12Quiz 3 Questions and End of Time Complexity
R13Space Complexity III (PDF)
R14Probabilistic Complexity and Interactive Proofs

 








© 2010-2021 OpenCollege.com, All Rights Reserved.
Open College is a service mark of AmeriCareers LLC.