CSC361

 Finite Automata and Formal Languages

The content posted on this web site is copyrighted material. Disseminating class content online violates copyright.

 

             Syllabus

             Resources

 

             TENTATIVE schedule 

                  NOTE: I accidentally deleted the schedule. Below are links to all the powerpoint slides.

Class Lecture Read
  Introduction  
  Finite Automata  
  NFA vs. DFA  
  Regular Expressions  
  Regular Expressions and Finite Automata  
  Pumping Lemma  
  DFA Minimization  
  Context-free Grammars  
  Pushdown Automata  
  Languages and Automata  
  Closure Properties and Non Context-Free Languages  
  Turing Machines  
  Turing Machine Computations  
  Turing Enumerable  
  Undecidabillity  
  Halting Problem  
  Chomsky Normal Form  
  Greibach Normal Form  
  Java Grammar and Parser  
  LL Parsers  
  LR Parsers  
  Myhill-Nerode Theorem  

 
Lisa Frye, PhD frye@kutztown.edu
Old Main 254 (610) 683-4422 (office)
(484) 619-3132 (ONLY during office hours)
Office Hours (F2F and Online via Zoom or MS Teams):
  Mon   2:30-4:00pm  Tue  8:00-10:00am  
  Wed   2:30-4:00pmm Other times by appointment