Course Notes

Notes are in Microsoft Powerpoint format. They can be read on any of the Windows computers in the UCF labs, or, if you're on another computer and don't have Powerpoint, you can get a free viewer from Microsoft.

Overview - 10 pages (8/23/2001)

Finite Automata (Dr. Workman's notes) - 21 pages of Word file (9/18/2001)

Regular Expressions and Languages - 16 pages (9/24/2001), plus a two-page handout on converting DFA to an equivalent regular expression.

Pumping Lemma for Regular Languages (Dr. Workman's notes) - pages 48 - 51 of Word file (10/08/2001)

Closure Properties of Regular Languages (Dr. Workman's notes) - pages 25 - 35 of Word file (10/08/2001), plus a four-page handout on DFA minimization

Context-free Languages and Pushdown Automata (Dr. Workman's notes) - 23 pages of Word file (10/30/2001)