CS454: Theory of Computation

Course Overview

  • Course Title: CS454 Theory of Computation (3 Credits)
  • Location: EB 1145
  • Time: M & W 10:00 – 11:15 a.m.
  • Course Web Site: (archived)
  • Assignment Dropbox: (archived)

Syllabus

Download |

Open Educational Resources

Resource Link(s)
Theory of Computation: Making Connections    
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 Aug. 22, 24 Introduction and Course Overview
**Regular Languages: **
02 Aug. 29, 31 Deterministic Finite Automata (DFA)
Non-Deterministic Finite Automata (NFA)
03 Sep. 05, 07 Labor Day
Regular Expressions and Regular Grammars
04 Sep. 12, 14 Closure Properties
Non-Regular Languages, Pumping Lemma
05 Sep. 19, 21 Context Free Language (CFL)
Context Free Grammars
06 Sep. 26, 28 MID TERM EXAM (E1)
Push-Down Automata, Normal Forms
07 Oct. 03, 05 Pumping Lemma for CFL
CFL Properties and Equivalence
08 Oct. 10, 12 Recursively Enumerable Languages (REL)
Recursive vs. REL
09 Oct. 17, 19 Turing Machines (TM)
10 Oct. 24, 26 Halting Problem
MID TERM EXAM (E2)
11 Oct. 31, Nov. 02 instructor on travel
12 Nov. 07, 09 Computational Complexity: Undecidability
13 Nov. 14, 16 Complexity Classes: P, NP, NP-C
P vs. NP
14 Nov. 21, 23 THANKSGIVING BREAK
15 Nov. 28, 30 Satisfiability: Cook’s Theorem
Church-Turing Thesis
16 Dec. 06, 08 Topics to be Announced 1
17 Dec. 15 FINAL EXAM (FE) @10:00 - 11:40 a.m.

Course Assignments

Graduate Project

Assignment Due Date Dropbox
Project Proposal (M1) Wednesday, September 07 @ 01.29:59 p.m.
Project Progress Report (M2) Wednesday, October 19 @ 01.29:59 p.m.
Final Report (M4) Wednesday, December 08 @ 01.29:59 p.m.

CS454 In a Nutshell

nutshell

  1. Graduate Project Presentations ↩︎

Last updated on Aug 16, 2022