Computer Science/Math 332

THEORY OF COMPUTING

January 2014

Week of | Material Covered | Remarks |

January 6 | Introduction to Theory of Computing | |

January 13 | Mathematical review | |

January 20 | Finite automata | |

January 27 | Finite automata | |

February 3 | Regular Expressions and Languages | |

February 10 | Properties of Regular Languages | |

February 12 | Midterm | |

February 17 | Mid semester break | No Classes |

February 24 | Context Free Grammar and Languages | |

March 3 | Pushdown Automata | |

March 10 | Properties of Context-Free Languages | |

March 17 | Introduction to Turing Machines | |

March 24 | Undecidability and Intractable Problems | |

March 31 | Review |

Last modified:Thursday December 25, 2014 at 05:39 pm

Cezar Câmpeanu

Cezar Câmpeanu