cs133

Semester 2, AY 2018--2019.
 by Francis George C. Cabarle


``The introduction of suitable abstractions is our only mental aid to reduce the appeal to enumeration, to organize and master complexity.'' — E. W. Dijkstra

  • Welcome to the class web page for CS 133 WFY! Files and announcements will be concatenated to this list, from oldest (top) to newest (bottom). Stay tuned!
  • 15-02-2019: Exam 1 is on 22 Feb 2019.
  • 27-02-2019: Please obtain your quiz 2 and exam 1 papers from ma'am Judith Martinez at the DCS admin office.
``The best theory is inspired by practice. The best practice is inspired by theory.''
-- Donald E. Knuth
 Weektopics Resources
1Introduction,
regular languages and finite automata, regular operations.
Day 1RR1
Day 2Day 3
DFA with JFLAP simulator
Nondeterministic finite automata,
equivalence of DFA and NFA,
Minimization of states. 
Day 4Day 5
Regular expressions,
equivalence of regular expressions to finite automata.
 
Nonregular languages, Pumping lemma,
Review for exam 1,
EXAM1 (22 Feb 2019)
Day 6 
exam1 reviewer
 5 CFLs, CFGs,
CFG in CNF, closure properties
Day 9Day 10
Day 11 , RR2
PDAs,
CFGs and PDAs
 Day 12Day 13
CFG and PDA with JFLAP simulator
problem set for exam2
DPDA,
NonCF languages,
Review for exam2 
Day 14 
EXAM2 (TBA)  
Turing machines, transducers,
Variants (e.g. multitape, nondeterministic),
Universal TM
RR3RR4Day 17
Day 18Day 19
Turing machines in JFLAP simulator
10  More on recursive (decidable) and 
recursively enumerable languages,
Noncomputable languages,
Chomsky hierarchy so far
Review for exam3
 Day 20 (RR5)
Day 21Day 22
Day 23
reviewer
   
11Reducibility,
Time complexity and complexity classes
Day 23 (PCP example)
Day 24RR6Day 25
Day 26 (More on Cook-Levin Theorem
Some computationally hard games, 3SAT to CLIQUE)
reviewer
Video: Complexity of counting all (Eulerian) paths.
 EXAM3 (TBA) 
 REMOVAL EXAM ()