CSCI 470 Spring 2015
Languages and Machines
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

CSCI 125
CSCI 255
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

1MonJan 05
  • None
  • No class yet

    WedJan 07
  • Introduction to the course
  • Discrete mathematics review
  • P-NP-NP-Complete (Picture)
  • Compexity Classes

  • 2MonJan 12
  • Languages
  • Proofs!
  • Chapter 0
  • Languages Notes
  • Proofs Notes
  • Proof Examples
  • Induction Proofs
  • Active Intro to Discrete Math
  • HW 0 due

    WedJan 14
  • Proofs
  • Other stuff

  • 3MonJan 19Finite Automata
  • Chapter 1.1
  • Finite State Machines Notes
  • JFlap
  • JFlap Tutorial
  • HW 1 due

    WedJan 21DFAs

    4MonJan 26NFAsChapter 1.2HW 2 due

    WedJan 28Regular Expressions
  • Chapter 1.3
  • Regular Expressions
  • xkcd: Regular Expressions
  • HW 3 due

    5MonFeb 02Nonregular Languages
  • Chapter 1.4
  • Pumping Lemma for regular languages (Wikipedia)
  • HW 4 due

    WedFeb 04Non-regular languages

    6MonFeb 09Winter BreakNo Class

    WedFeb 11Chapters 0-1 (Catch up and review)HW 5 due

    7MonFeb 16Chapters 0-1
  • Paper
  • Pencil
  • Exam 1

    WedFeb 18Context-Free Grammar
  • Chapter 2.1
  • Grammar Notes
  • C++ Grammar
  • Java Grammar
  • A simple grammar

  • 8MonFeb 23
  • Pushdown Automata
  • Chapter 2.2

    WedFeb 25
  • Pushdown Automata
  • Non-Context-Free Languages
  • Chapter 2.3HW 6 due

    9MonMar 02
  • Non-Context-Free Languages
  • CFL Pumping Lemma
  • HW 7 due

    WedMar 04
  • Equality of CFGs (Problem 2.6b)
  • CFG wrap-up
  • HW 8 due

    10MonMar 09
  • Turing Machines
  • Chapter 3.1
  • Turing Machines (PowerPoint)
  • Turing Machine State Diagram
  • Turing Machine Cartoon
  • Turing Machine Simulator
  • xkcd: Candy Button Paper
  • xkcd: A Bunch of Rocks
  • LEGO Turing machine

  • WedMar 11
  • Turing Machine Variants
  • Algorithms
  • Church-Turing Thesis
  • Chapter 3.2-3.3
  • Turing Machine Variants (PowerPoint)
  • Turing Machine Simulator
  • HW 8 redo
    (2.31 and 2.32)

    Spring Break Week

    11MonMar 23Church-Turing Thesis
  • Church-Turing Thesis
  • Church-Turing Thesis Definitions
  • HW 9 due

    WedMar 25Decidable Languages
  • Chapter 4.1
  • Decidability Notes

  • 12MonMar 30Chapters 0-3
  • Pencil
  • Paper
  • Definition/Results sheet
  • Exam 2

    WedApr 01Undecidability
  • Chapter 4.2
  • Halting Problem Notes
  • How Dr. Seuss would prove the halting problem undecidable

  • 13MonApr 06Reducibility
  • Chapter 5.1 (skim 220-226)
  • Reducibility Notes
  • HW 10 due

    WedApr 08
  • PCP
  • Reducibility
  • Chapter 5.2 (skim)
  • Chapter 5.3
  • Reducibility Notes

  • 14MonApr 13
  • Reductions
  • Complexity
  • Chapter 7.1
  • Reducibility Notes
  • NP-Complete Notes

  • WedApr 15
  • Complexity
  • Chapter 7.2-7.3 (Skim 290-291)
  • Complexity Notes
  • NP-Complete Notes
  • HW 11 due

    15MonApr 20
  • NP
  • NP-Complete
  • Chapter 7.4-7.5 (skim 305 to top of 311 and 314-318)
  • Reduction Examples
  • Complexity Notes
  • HW 12 due

    WedApr 22
  • Final Exam Review
  • Semester Wrap-up
  • HW 13 due (Thursday by 9am)

    ExMonApr 27The whole book
  • Pen or Pencil
  • Paper
  • Definition/Results Sheet
  • Brain
  • Exam 3 12:30-2:30pm