Schedule for CS3311
Formal Models of Computation
Spring 2017


Week Date Topic/Read Before Class Assignment
1 M, 01/09 Course information, go over the syllabus
Section 1.1 Set Theory
 
  W, 01/11 Section 1.1 Set Theory (cont'd)
   Methods of defining infinite sets
Section 1.6 Recursive definitions
Homework 1 (pdf)
  Th, 01/12 Make-up Thursday class due to conference cancellations
Time: 6:05pm-6:55pm
Location: Fisher 329
Section 1.1 Set Theory (cont'd)
   Set operations
   Set relations
 
  F, 01/13 Section 1.1 Set Theory (cont'd)
   Complement of a set
Section 1.6 Recursive definitions (cont'd)
   More examples
 
2 M, 01/16 no class -- Martin Luther King, Jr. Day recess  
  W, 01/18 Review homework 1 answers Homework 2 (pdf)
  Tu, 01/19 Make-up Thursday class due to conference cancellations
Time: 6:05pm-6:55pm
Location: Fisher 329
Section 1.7 Mathematical induction
   Inductive proof for a summation
   Inductive proof for a program with a loop
 
  F, 01/20 Section 1.7 Mathematical induction
   Inductive proof for a recursive definition
   Inductive proof fallacies
 
3 M, 01/23 Chapter 2 Languages
   Section 2.1 Strings and languages
   Section 2.2 Finite specification of languages
 
  W, 01/25 Review homework 2 answers
Section 2.1 Strings and languages (cont'd)
   Concatenation and Kleene Star
Section 2.2 Finite specification of languages (cont'd)
   Examples
Homework 3 (pdf)
  F, 01/27 Section 2.3 Regular sets and expressions
   Regular set examples
 
4 M, 01/30 Section 2.3 Regular sets and expressions (cont'd)
   Compare regular sets and regular expressions
   Regular expression examples
 
  W, 02/01 Review Homework 3 answers
Section 2.3 Regular sets and expressions (cont'd)
   Regular expression examples
Homework 4 (pdf)
  Th, 02/02 Exam 1
Time: 6:00pm - 7:30 pm
Location: EERC 0100
Sections covered:
  Section 1.1 Set Theory
  Section 1.2 Cartesian Product
  Section 1.6 Recursive Definitions
  Section 1.7 Mathematical Induction
  Section 2.1 Strings and Languages
  Section 2.2 Finite Specification of Languages
  Section 2.3 Regular Sets
 
  F, 02/03 Section 2.3 Regular sets and expressions (cont'd)
   Regular expression examples involving "not"
     E.g., does not include 'ab'
 
5 M, 02/06 The big picture: language hierarchy, the class of regular languages
Chapter 5: Finite Automata
  Section 5.2 Deterministic Finite Automata
  Section 5.3 State Diagrams and Examples
 
  W, 02/08 Review homework 4 answers
Chapter 5: Finite Automata
  Section 5.3 State Diagrams and Examples (cont'd)
Homework 5 (pdf)
Valentine's Day Bonus (pdf)
  F, 02/10 No class -- Winter Carnival  
6 M, 02/13 Chapter 5: Finite Automata
  Section 5.3 State Diagrams and Examples (cont'd)
  Creating a machine for L(M)
 
  W, 02/15 Review Homework 5 answers
Chapter 5: Finite Automata
  Creating a machine for L(M1) ∩ L(M2)
Homework 6 (pdf)
  F, 02/17    
7 M, 02/20    
  W, 02/22 (Note: the MTU Career Fair is today, on Wednesday, 2/22.) Homework 7 (pdf)
  F, 02/24    
8 M, 02/27    
  W, 03/01   Homework 8 (pdf)
  Th, 03/02 Exam 2
Time: 6:00pm - 7:30 pm
Location: EERC 0100
 
  F, 03/03 no class -- Exam 2 day  
-- M, 03/06 no class -- Spring recess  
  W, 03/08 no class -- Spring recess  
  F, 03/10 no class -- Spring recess  
9 M, 03/13    
  W, 03/15   Homework 9 (pdf)
  F, 03/17    
10 M, 03/20    
  W, 03/22   Homework 10 (pdf)
  F, 03/24    
11 M, 03/27    
  W, 03/29   Homework 11 (pdf)
  Th, 03/30 Exam 3
Time: 6:00pm - 7:30 pm
Location: Fisher 329
 
  F, 03/31    
12 M, 04/03    
  W, 04/05   Homework 12 (pdf)
  F, 04/07    
13 M, 04/10    
  W, 04/12   Homework 13 (pdf)
  F, 04/14    
14 M, 04/17    
  W, 04/19    
  F, 04/21    
Finals TBA Exam 4 (Final Exam, not cumulative)
Time: 12:45pm - 2:45pm
Location: Fisher 325 (regular classroom)
Good luck!

Note: A week-long homework is assigned almost every Wednesday.
 

(Created: January 6, 2017)