Spring 2019

Date | Topic | Reading | Assignment |
---|---|---|---|

1/23 | Introduction & Preliminaries | ||

1/25 | Proofs/Proof Techniques | Sipser 0.1 ~ 0.4 | |

1/28 | Deterministic Finite Automata | Sipser 1.1 | Assignment 01 |

1/30 | Nondeterministic Finite Automata | Sipser 1.2 | |

2/01 | Finite Automata (Cont...) | ||

2/04 | Regular Expressions | Sipser 1.3 | |

2/06 | Equivalence of FA | Assignment 02 | |

2/08 | Non-regular Languages | Sipser 1.4 | |

2/11 | Context Free Grammar | Sipser 2.1 | |

2/13 | Context Free Grammar (Cont..) | Assignment 03 | |

2/15 | Non-Context Free Languages | Sipser 2.3 | |

2/18 | Pushdown Automaton | Sipser 2.2 | |

2/20 | Pushdown Automaton (Cont..) | Assignment 04 | |

2/22 | Pause for breath | ||

2/25 | Hour Exam 01 |
||

2/27 | Turing Machines | Sipser 3.1 | |

3/01 | Turing Machines (Cont..) | ||

3/04 | Turng Machine Variants | Sipser 3.2 | |

3/06 | The definition of Algorithms | Sipser 3.3 | |

3/08 | Decidability | Sipser 4.1 | |

3/11 | Undecidability | Sipser 4.2 | Assignment 05 |

3/13 | Reducibility | Sipser 5.1-5.2 | |

3/15 | Mapping Reducibility | Sipser 5.3 | |

Spring Break | |||

4/01 | Rice's Theorem | Assignment 06 | |

4/03 | Review (so far ...) | ||

4/05 | Hour-Exam 02 |
||

4/08 | Measuring Complexity | Section 7.1 | |

4/10 | Class P | Sipser 7.2 | |

4/12 | Class NP | Sipser 7.3 | |

4/15 | NP-Completeness | Sipser 7.4 | |

4/17 | NP-Complete Problems | Sipser 7.5 | Assignment 07 |

4/19 | NP-Complete Problems | ||

4/22 | Recursion Theorem | Sipser 6.1 | |

4/24 | Cryptography | Sipser 10.6 | |

4/26 | Cryptography | Assignment 08 | |

4/29 | Pause for breath | ||

5/01 | Class Presentations | ||

5/03 | Class Presentations | ||

5/06 | PSPACE & Savitch's Theorem | Sipser 8.1, 8.2 | |

5/08 | Review | ||

5/10 | Review | ||

5/15 & 5/17 | Final Exam |