CMPS 260 (Theoretical Foundations of Computer Science)
Spring 2020
Syllabus
Zoom Guide
Student File Submission System
Test/Quiz Information
Midterm test on March 12
Preview
Sample Solutions
Final exam
: 3pm, Tuesday, May 19
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: Regular Languages, Pumping Lemma, q-grammars
Sample Solutions
Homework #6: Context-free Grammars, a little Pushdown Automata
Sample Solutions
Homework #7: DPDA's, CFL's, Turing Machines, Recursive/RE Languages
Sample Solutions
Programming Assignments
Program #1: Regular Expressions
Lecture Notes
A few examples of proofs
Some Laws of Sets and Logic
Subset Construction: Converting an NFA to a DFA
DFA Minimization
Linz Chapter 4
Pumping Lemma for Regular Languages:
Statement and Proof
Illustration
Notes on Left-to-Right Top-Down Parsing
Removing Useless Symbols from a CFG
CFG to CNF: Algorithm and Example
CYK Algorithm and Example
PDA Examples
Pumping Lemma for CFL's
CFL Closure Properties
Hopcroft on Turing Machines
Linz Chapters 9-10
Notes on Linz Chapters 9-11
Notes on Linz Chapter 14