4003-380: Introduction to
Computer Science Theory
Weekly Diary
Weekly Updates of Material Covered and
other pertinent info (including links to the slides) will be listed here.
Week 1:
- Thursday, Sept 5 - Intro & Logistics
- Logistics (
slides
)
- Basics -- Review of Discrete Math / Intro
to Languages (slides
)
- Tuesday, Sept 10 - Recursive Definitions
and Proofs
Week 2:
- Thursday, Sept 12- Regular Languages
- Tuesday, Sept 17 - Finite Automata
Week 3:
- Thursday, Sept 19 - FAs: Non-Determinism
(slides
)
- Tuesday, Sept 24 - Kleene Theorem
Week 4:
- Thursday, Sept 26 -- Decision Properties:
Minimal FAs
- slides
- Field Guide for Kleene Theorem Algorithms
- Tuesday, Oct 1
Week 5:
- Thursday, Oct 3 -- CFL and Regular
Languages
- Tuesday, Oct 8 -- Midterm Review
Week 6
- Thursday, Oct 10 -- MIDTERM
- Tuesday, Oct 15 -- Parse Trees
& Pushdown Automata
Week 7
- Thursday, Oct 17 -- PDA <->
CFG Equivalence
- Tuesday, Oct 22 -- Chomsky Normal
Form / Pumping Lemma / Decision and Closure Properties of CFLs
Week 8
- Thursday, Oct 24 -- Turing Machines
I (slides
)
- Tuesday, Oct 29 -- Turing Machines
and Languages
Week 9
- Thursday, Oct 31 -- Unrestricted
Grammars (slides
)
- Tuesday, Nov 5 -- Computability
Week 10
- Thursday, Nov 7 - Computational
Complexity (slides
)
- Tuesday, Nov 12 -
Final Exam Review
last updated: 11/13/02