CS 252 - Introduction to Computational Theory - Sections 1 & 2, Winter 2016

LECTURE NOTES

Team assignments are due at the beginning of the class lecture on the due date. Late assignments will not be accepted; however, you are only required to turn in five (out of ten) team assignments.
  • Chapter 2 - Languages (in PowerPoint or PDF format)

  • Team Assignment 1 Problems (in PDF format)

    •
  • Chapter 5 - Finite Automata (in PowerPoint or PDF formats)

  • Team Assignment 2 Problems (in PDF format)

    •
  • Chapter 6 - Regular Languages and Sets (in PowerPoint or PDF format)

  • Team Assignment 3 Problems (in PDF format)

    •
  • Chapter 3 - Context-Free Grammars (in PowerPoint or PDF formats)

  • Team Assignment 4 Problems (in PDF format)

    •
  • Chapter 7 - Pushdown Automata and Context-Free Languages (in PowerPoint or PDF format)

  • Team Assignment 5 Problems (in PDF format)

    •
  • Chapter 19 - LL(K) Grammars (in PowerPoint or PDF format)

  • Team Assignment 6 Problems (in PDF format)

    •
  • Chapter 8 - Turing Machines (in PowerPoint or PDF format)

  • Team Assignment 7 Problems (in PDF format)

    •
  • Chapter 10 - The Chomsky Hierarchy (in PowerPoint or PDF format)

  • Chapters 11 & 12 - Decision Problems and Undecisibility (in PowerPoint or PDF formats)

  • Team Assignment 8 Problems (in PDF format)

    •
  • Chapter 14 - Time Complexity (in PowerPoint or PDF formats)

  • Team Assignment 9 Problems (in PDF format)

    •
  • Chapter 15 - P and NP (in PowerPoint or PDF formats)

  • Team Assignment 10 Problems (in PDF format)

    •

    • Created: March 29, 2006
    Updated: April 7, 2016