CSCI 339 Tentative Schedule

     Cycle                  Topic                                                                                          Assignment
1
 Mathematical Preliminaries, Introduction to Languages, Grammars, and Automata Read Chapter 1.1-1.3
Do Problems 1, 4, 5, 8, 11 p. 26-28
2
Finite State Automata:
Deterministic FSA's, Nondeterministic FSA's
 Read Chapter 2.1-2.3:   Do Problems 1,2,3,4,9,11,12,13 p. 47-49; Problems 2,4,5,6,8,11 p. 55
3
Finite State Automata and Regular Expressions
 Read Chapter 2.4, 3.1, 3.2
Do Problems 1 and 2 p. 68; Problems 1, 2, 5,8,14,15 p. 75
4
Regular Grammars and
Properties of Regular Languages
 Read Chapter 3.3, 4.1-4.3
Problems 4,7,9,10 page 87;1,2,3,10 page 96; 3-11 page 122
5
Context Free Languages
 Chapter 5 Problems 7,8,9,16 p. 133; 6,7,8,13 p 145
6
Context-Free Grammars
Midterm
 Chapter 6 Problems 5,6,7,8,9,13 p.s 162; 2,3,4,9,10,11 p. 169
7
Push-Down Automata
 Chapter 7 Problem 4,5,6,7 p 183;  handout
8
Properties of Context-Free Languages/Pumping Lemma/Ogden's Lemma
 Chapter 8 Problems 2,3,4,7,8 p. 212
9
Turing Machines
 Chapter 9 Problem 7,8,9,10 p 236
10
Other Models of Computation
 Chapter 10.1-10.4  Problems 4,9 p. 256; 3,4 p. 266
11
Heirarchy of Formal Languages and Computability
 Chapter 11 , Chapter 12 - Handout problems
12
Computability and Unsolvable Problems
 Chapter 12 and Handout Problems 5,6,12 p. 321; 2 p. 309

Final Exam will be Tuesday, December 15 at 3:30 PM