CS547 Assignment 1 (25% of grade)



   February 2005
 S  M Tu  W Th  F  S
13 14 15 16 17 18 19
             ^assigned
20 21 22 23 24 25 26
27 28  1  2  3  4  5
       ^no class:  makeup will be a help session after spring break
	     ^due
   March 2005
 6  7  8  9 10 11 12
    week of spring break
13 14 15 16 17 18 19





  • 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) upload your files (with source, if any) to the
k9.cs.wustl.edu/~cs160/cs547 directory (here).  You may see comments on your
practice assignments there, sometime this week.  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 (see past year examples from guandong in course
subdirectory) 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. Definition of regular expressions and the regular languages they denote;


      

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


      

    4. Reduction of regular expressions to NFA's;


      

    5. Reduction of DFA's to regular languages;


      

    6. Statement, Proof, and Example Use of the pumping lemma;


      

    7. Definition of the minimal DFA for a given language L.


    


    

  • 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-.