Dates
Topics
Reading
(Read before class)
Assignments Due
Jan 17
Course overview.
Intro to parsing (see links in Class Material webpage).
Sets, relations, functions, equivalence relations.
Preface and Introduction of Sudkamp text.
Start working on Assignment 1 tonight.
Bring questions
to class tomorrow.
Jan 18
Countable and uncountable sets. Diagonalization.
Sections 1.1 - 1.5
Jan 19
Recursive Definitions. Induction.
Sections 1.6 - 1.8
Assignment 1:
Chapter 1 exercises
1a, 1d, 1e, 2c, 4,
7, 12, and 14.
Hand in at start of class today.
Also hand in a 3"x5" card with your
name in large print and your picture on it.
Jan 24
Directed graphs.
Jan 25
Questions.
Jan 26
Strings and languages.
Section 2.1 - 2.2
Assignment 2:
Chapter 1 exercises
16, 19, 24, 29, 32, 36, 38, 44, 47.
Jan 31
Regular Sets
Sections 2.3
Assignment 1 Re-Do due
Feb 1
Regular Expressions
Sections 2.4
Feb 2
Context-free grammars and languages
Section 3.1
Feb 7
Example grammars
Sections 3.2
Assignment 3:
Chapter 2 exercises
8, 15, 26, 37, 39c.
Here is explanation of how to use
egrep to test your regular expressions.
Assignment 2 Re-Do also due.
Feb 8
Regular grammars. Verifying grammars.
Sections 3.3 - 3.4
Feb 9
Leftmost derivations and ambiguity. Programming language
definition.
Sections 3.5 - 3.6
Assignment 4:
Chapter 3 exercises
4, 6c, 7, 12, 14c, 16, 39b,
Feb 14
Quiz on Chapter 1
CFG Transformations.
Sections 4.1 - 4.2
Feb 15
Elimination of lambda and chain rules and useless symbols
Sections 4.3 - 4.4
Feb 16
Chomsky and Greibach Normal Forms
Sections 4.5 - 4.8
Assignment 5:
Chapter 4 exercises
3, 4, 8, 15, 17
Feb 21
Deterministic Finite Automata
Sections 5.1 - 5.3
Assignment 3 Re-Do. Assignment 4 Re-Do.
Feb 22
Nondeterministic Finite Automata, lambda-transitions
Sections 5.4 - 5.5
Feb 23
Removing nondeterminism
Section 5.6
Assignment 6:
Chapter 4 exercises: 19, 26 (not required), 28, 32. Do 26 for extra
credit, first time only.
Chapter 5 exercises:
1, 5, 13, 22e
Feb 28
Quiz on Chapter 2
DFA minimization
Section 5.7
Assignment 5 Re-Do.
Mar 1
More examples of minimization.
Mar 2
Finite Automata and Regular Languages
Sections 6.1 - 6.2
Assignment 7:
Chapter 5 exercises: 25c, 25d, 33, 36, 40c, 41, 45b
Mar 7
Finite Automata and Regular Languages
Sections 6.3 - 6.4
Assignment 6 Re-Do.
Mar 8
Pumping Lemma for Regular Languages
Sections 6.5 - 6.7
Mar 9
Quiz on Chapters 3 and 4
Assignment 8:
Chapter 6 exercises: 2b, 2c (from Chapter 5, 40b and c), 5, 14b
Mar 13 - 17
Spring Break
Mar 21
Pushdown Automata and Context-Free Languages.
Sections 7.1 - 7.3
Assignment 7 Re-Do.
Mar 22
Pumping Lemma for Context-Free Languages and Closure
Sections 7.4 - 7.5
|
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
