CS547 Assignment 2 (50% of grade)



   March 2005
 S  M Tu  W Th  F  S
20 21 22 23 24 25 26
             ^assigned
27 28 29 30 31  1  2
   April 2005
 3  4  5  6  7  8  9
       ^due
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30






  • You are to work individually, but you can get help from other people
if you want.  You may hand this assignment to me in hard copy, or (or
both) scan and upload your files to the k9.cs.wustl.edu/~cs160/cs547
directory (here).

If your work is late, it probably still counts as if it were not late, if
you hand it in correctly and don't make extra work for me.  This also
applies to people who want to revise their work.  HOWEVER I will not put
much effort into commenting on or correcting anything that is late; I will
just assign it a grade.


    

  • You are to outline BY HAND (do not typeset) the following material, as
elegantly, creatively, precisely, mathematically appropriately, and
succinctly as possible:


      


      

    1. Definition of DFA and NFA, and the language accepted by a machine;


      

    2. Reduction of NFA's to DFA's;


      

    3. Definition of the minimal DFA for a given language L;


      

    4. Definition of a NPDA and DPDA, and conditions for acceptance;


      

    5. Definition of a CFG and the language derivable from a grammar;


      

    6. Reduction of CFG to NPDA;


      

    7. Reduction of NPDA to CFG;


      

    8. Definition of regular grammar and equivalence to regular languages;


      

    9. Pumping lemma for CFL's.



    


    

  • If you do not innovate, you can expect a B+.
If you look like you learned something from the exercise, put time into
it, and are keeping pace, you can expect a B-.