CPSC 313 — Tutorial Exercises
u of c faculty of science computer science cpsc 313
Review
January 13 Review of Logic and Discrete Mathematics
  Solution for Question #5
Finite Automata and Regular Languages
January 17–19 Decision Problems and Languages; Introduction to DFAs
January 20–26 Design and Verification of DFAs
January 31 – February 2 Interpretation and Design of NFAs and epsilon-NFAs
February 3 Regular Expressions
February 7–9 Equivalence of Finite Automata and Regular Expressions
February 14–16 Proving That Language are (or are not) Regular
Context-Free Grammars and Languages
February 28 – March 2 Interpretation, Design, and Verification of CFGs
March 7–9 Ambiguity in Context-Free Grammars and Languages
March 14–16 Chomsky Normal Form
March 17–23 Proving Languages are (or are not) Context-Free
Turing Machines and Decidability
March 28–30 Interpretation and Design of Turing Machines
April 4–6 Turing Machine Variants and Simulations
April 11–13 Reductions and Undecidability

Please try to solve problems on these exercises before attending tutorials when these are to be discussed!



This page was most recently changed on Tuesday, March 29, 2005 by Wayne Eberly.