Calendar
August 2003
Sun  Mon  Tue  Wed  Thu  Fri  Sat 





1

2 
3 
4

5 
6

7 
8

9 
10 
11

12 
13

14 
15

16 
17 
18

19 
20
Class 1
Intro: course, language, alphabet

21 
22
Class 2
Intro DFA concept & JFLAP

23 
24 
25
Class 3
Comp, instersect,union machines with diagrams

26 
27
Class 4
Set Theory basics

28 
29
Class 5
Functions & a formal definition of a DFA

30 
31 







Calendar
September 2003
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

1
Labor Day
No Class

2 
3
Class 6
Formal algorithms for complement machine, etc.

4 
5
Class 7
Algorithms on Machines

6 
7 
8
Class 8
More algorithms on machines

9 
10
Class 9
Formal def of accept & config

11 
12
Class 10
Proof and Informal NDFA

13 
14 
15
Class 11
Formal definition of NDFA

16 
17
Class 12
Algorithms on NDFA's

18 
19
No Class
Cancelled due to hurricane

20 
21 
22
Class 13
PostHurricane, Chauvenet & web server down

23 
24
Class 14
XPeriod Exam
Proof Class

25 
26
No Class
Comp Time!

27 
28 
29
Class 15
NDFA's to DFA's

30 





Calendar
October 2003
Sun  Mon  Tue  Wed  Thu  Fri  Sat 



1
Class 16
NDFA's to DFA's Part Deux

2 
3
Class 17
, and Regular Expression intro

4 
5 
6
Class 18
Formal definition of a Regular Expression, conversion to FA

7 
8
Class 19
Lab: Perl Regular Expressions

9 
10
Class 20
Equivalence of Regular Expressions and FAs

11 
12 
13
Columbus Day
No Class

14 
15
Class 21
Pumping Lemma I

16 
17
Class 22
Pumping Lemma II

18 
19 
20
Class 23
FA Minimization

21 
22
Class 24
Pumping Lemma Reprise

23 
24
Class 25
Contextfree Grammars

25 
26 
27
Class 26
Parse trees & ambiguity

28 
29
Class 27
Simple Algorithms for Grammars

30 
31
Class 28
Push Down Automata



Calendar
November 2003
Sun  Mon  Tue  Wed  Thu  Fri  Sat 






1 
2 
3
Class 29
CFGs to PDAs

4 
5
XPeriod Exam
Sampson G14
No Class

6 
7
Class 30
Return exams, No homework

8 
9 
10
Class 31
Pumping lemma for GFLs

11
Veteran's Day

12
Class 32
What isn't a CFL

13 
14
Class 33
LAB: Parsing, bison and something practical

15 
16 
17
Class 34
Turing machines intro (with JFLAP)

18 
19
Class 35
A formal definition of Turing machines

20 
21
Class 36
Quiz 7
Equivalence of our TMs and the book's TMs.

22 
23 
24
Class 37
Equivalence of our TMs and JFLAP's TMs

25 
26
Class 38
More TM Models & the ChurchTuring Thesis.

27
Thanksgiving

28
No Class

29 
30 







Calendar
December 2003
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

1
Class 39
Universal TM I

2 
3
Class 40
Halting Problem & undecidability

4 
5
Class 41
Catchup & SOFs

6 
7 
8

9 
10

11 
12
Final Exam
Sampson G14
1330

13 
14 
15

16 
17

18 
19

20 
21 
22

23 
24

25 
26

27 
28 
29

30 
31





