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, January 29, 2009, 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.
-
Work Exercise 1.16 on page 86 of your textbook.
-
Work Exercise 1.17 on page 86 of your textbook.
-
Work Exercise 1.18 on page 86 of your textbook.
-
Work Exercise 1.19 on page 86 of your textbook.
-
Work Exercise 1.21 on page 86 of your textbook.
-
Harder than the others. Draw a minimal DFA that accepts the
language of all binary numerals for positive integers that are equivalent
to 1 modulo 3. We allow a numeral to have leading zeros; for example,
1101, 01101, and 001101 are all binary numerals for 13. Your DFA must
have exactly three states.
Back to
Course Page