AUTOMATA THEORY

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 )
  
• Finite Automata (ps and pdf )
  
• Regular Expressions and Regular Grammars (ps and pdf )
  
• Pumping Lemma (ps and pdf )
  
• Minimizing DFA (ps and pdf )
  
• Context-free grammars(ps and pdf )
  
• Transforming Grammars (ps and pdf )
  
• Pushdown Automata (ps and pdf )
  
• Parsing (ps and pdf )
  
• LR Parsing (ps and pdf )
  
• LL Parsing (ps and pdf )
  
• Properties of CFL (ps and pdf )
  
• Turing Machines (ps and pdf )
  
• Turing Machines as Building Blocks (ps and pdf )