University of Nevada Las Vegas
Howard R. Hughes College of Engineering
School of Computer Science
My Home Page

CSC 456/656 Assignment 2

Due date: Thursday, September 11, 2008, 2:30 PM.

All assignments must be handwritten (not typed or printed from a computer file) in your own handwriting, on 8.5 by 11 inch paper, or on A4 paper. Write your name on each sheet, and do not fold the pages or crimp the corners. (You may use a paper clip or a staple.)
Turn the pages in to me or to the graduate assistant on or before the due date.
  1. Find an NFA with four states which accepts the language generated by the regular expression (a+b)*a(a+b)b.
  2. Find a DFA with six states which accepts the language generated by the regular expression (a+b)*a(a+b)b.
  3. Find a regular expression which generates the language accepted by these DFAs. Here is pdf version.
  4. Find a minimal DFA equivalent to this NFA.
    If you can't read that, try this version.
    If you still can't read it, try this version.

Back to Course Page