CMPS 260 (Theoretical Foundations of Computer Science)
Spring 2019

Syllabus

Student File Submission System     

Test Information

• Final exam is at 3pm on Wednesday, May 15 in the usual classroom. Preview
• Mid-term test on April 10.   The Test   Sample Solutions   Preview

Homework Assignments

• Homework #1: Sets, Relations, Proof Methods   Sample Solutions
• Homework #2: Grammars, Languages, Finite Automata   Sample Solutions
• Homework #3: Nondeterministic Finite Automata   Sample Solutions
• Homework #4: Regular Expressions   Sample Solutions
• Homework #5: Topics from Linz Chapters 2-4   Sample Solutions
• Homework #6: Pumping Lemma, CFG's, and PDA's   Sample Solutions
• Homework #7: CFL's and Turing Machines   Sample Solutions

Programming Assignments

• None yet.

Lecture Notes

• A few examples of proofs
• Subset Construction: Converting an NFA to a DFA
• DFA Minimization
• Pumping Lemma for Regular Languages
• Removing Useless Symbols from a CFG
• CYK Algorithm to decide membership in a CFL
• Notes on Left-to-Right Top-Down Parsing
• Notes on Topics from Chapters 9-11