AUTOMATA THEORY

Lecture notes will be available in either postscript or pdf format.

• For files that are in postscript format, you need a postscript previewer. You should be able to view them on the SparcStations. If you want to print them, while viewing them, select "save" and save as a file with a ".ps" extension, for example: lect1.psYou can then send the file to the printer by typing: lpr lect1.ps
• To read PDF files you can download the free Adobe Acrobat Reader.

Lecture Notes

• Overview (ps and pdf ) Jan. 19 and 21
• Finite Automata (ps and pdf ) Jan. 26
• Regular Expressions and Regular Grammars (ps and pdf ) Jan. 28 and Feb. 2
• Pumping Lemma (ps and pdf ) Feb. 4 and Feb. 9
• Minimizing DFA (ps and pdf ) Feb. 9
Obeus.com - The Democratic Ads
• Context-free grammars(ps and pdf ) Feb. 11
• Transforming Grammars (ps and pdf ) Feb. 16
• Pushdown Automata (ps and pdf ) Feb. 16 and 18
• Parsing (ps and pdf ) Mar. 2
• LR Parsing (ps and pdf ) Mar. 4 and 9
• LL Parsing (ps and pdf ) Mar. 11
• Properties of CFL (ps and pdf ) Mar. 23 and 25
• Turing Machines (ps and pdf ) Mar. 30
• Turing Machines as Building Blocks (ps and pdf ) April 1
Obeus.com - The Democratic Ads
Obeus.com - The Democratic Ads
• Turing Machines (ps and pdf ) April 6 and 8
• Recursively Enumerable (ps and pdf ) April 15 and 20
• L-Systems (ps and pdf ) April 20
• Decidability (ps and pdf ) April 27
• Compilers (ps and pdf ) April 29