CS 454: Theory of Computation

Course Overview

Syllabus

Download |

Open Educational Resources

Resource Link(s)
Models of of of Computation: Exploring the Power of Computing
Introduction to Theory of Computation
MIT OpenCourseWare: Theory of Computation  
JFLAP Automata Simulator

Tentative Schedule

The following schedule is tentative and is subject to adjustments and change. I reserve the right to change topics or add items of related interest. All changes will be announced in class.
Week Dates Topics Slides
01 Jan. 09. 11 Introduction and Course Overview
**Regular Languages: **
02 Jan. 16, 18 MLK Day
Deterministic Finite Automata (DFA)
03 Jan. 23, 25 Non-Deterministic Finite Automata (NFA)
Regular Expressions and Regular Grammars
04 Jan. 30, Feb. 01 Closure Properties
Non-Regular Languages, Pumping Lemma
05 Feb. 06, 08 Context Free Language (CFL)
Context Free Grammars
06 Feb. 13, 15 MID TERM EXAM (E1)
Push-Down Automata, Normal Forms
07 Feb. 20, 22 Pumping Lemma for CFL
CFL Properties and Equivalence
08 Feb. 27, Mar. 01 Recursively Enumerable Languages (REL)
Recursive vs. REL
09 Mar. 06, 08 SPRING BREAK
10 Mar. 13, 15 Turing Machines (TM)
11 Mar. 20, 22 Halting Problem
MID TERM EXAM (E2)
12 Mar. 27, 29 Computational Complexity: Undecidability
13 Apr. 03, 05 Reducibility, Rice Theorem
14 Apr. 10, 12 Complexity Classes: P, NP, NP-C
P vs. NP
15 Apr. 17, 19 Satisfiability: Cook’s Theorem
Church-Turing Thesis
16 Apr. 24, 26 Topics to be Announced 1
17 May. 02 FINAL EXAM (FE) @10:00 - 11:40 a.m.

Course Assignments

Graduate Project

Assignment Due Date Dropbox
Project Proposal (M1) Monday, January 23 @ 11:59:59 a.m.
Literature Survey (M2) Wednesday, March 15 @ 11:59:59 a.m.
Final Report (M4) Wednesday, April 26 @ 11:59:59 a.m.

CS454 In a Nutshell

nutshell


  1. Graduate Project Presentations ↩︎